default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 182
Volume 182, February 2015
- Jacek Blazewicz
, Alain Hertz, Christophe Picouleau, Marino Widmer:
Foreword. 1 - Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
Independent domination in finitely defined classes of graphs: Polynomial algorithms. 2-14 - Simone Dantas, Celina M. H. de Figueiredo, Frédéric Maffray, Rafael B. Teixeira:
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem. 15-24 - Marcin Jakub Kaminski, Martin Milanic:
On the complexity of the identifiable subgraph problem. 25-33 - Jean-François Culus, Marc Demange, Ruxandra Marinescu-Ghemeci, Cerasela Tanasescu:
About some robustness and complexity properties of G-graphs networks. 34-45 - Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon:
Directed weighted improper coloring for cellular channel allocation. 46-60 - Piotr Borowiecki, Dieter Rautenbach:
New potential functions for greedy independence and coloring. 61-72 - Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
Interval incidence graph coloring. 73-83 - Simone Dantas, Sylvain Gravier, Telma Pará:
Solitaire Clobber played on Cartesian product of graphs. 84-90 - Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle:
Constructions of k-critical P5-free graphs. 91-98 - Márcia R. Cappelle, Felix Joos, Janina Müttel, Dieter Rautenbach:
Badly-covered graphs. 99-103 - Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho:
Stable-iΠ partitions of graphs. 104-114 - Dvir Shabtay, George Steiner, Liron Yedidsion:
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. 115-121 - Antonio Jose Lozano, Juan A. Mesa, Frank Plastria:
Location of weighted anti-ordered median straight lines with Euclidean distances. 122-133 - Marta Szachniuk, Maria Cristina De Cola, Giovanni Felici, Dominique de Werra, Jacek Blazewicz:
Optimal pathway reconstruction on 3D NMR maps. 134-149 - Rafal Rózycki, Jan Weglarz:
Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic. 150-161 - Mateusz Gorczyca, Adam Janiak, Wladyslaw A. Janiak, Marcin Dymanski:
Makespan optimization in a single-machine scheduling problem with dynamic job ready times - Complexity and algorithms. 162-168 - Dmitrii Lozovanu, Stefan Pickl:
Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs. 169-180
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
