default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 234
Volume 234, January 2018
- Claudia Archetti
, Luca Bertazzi, Martin Milanic, David Schindl, Sacha Varone:
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. 1-2
- Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot:
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree. 3-11 - Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. 12-21 - Enide Andrade Martins, Domingos M. Cardoso, Luis Medina, Oscar Rojo:
On the dominating induced matching problem: Spectral results and sharp bounds. 22-31 - Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
On the resilience of canonical reducible permutation graphs. 32-46 - Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimal graphs for matching extensions. 47-55 - Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the forbidden induced subgraph probe and sandwich problems. 56-66 - Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira:
The partitioned probe problem: NP-complete versus polynomial dichotomy. 67-75 - Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray:
A coloring algorithm for -free line graphs. 76-85 - Marta Kasprzak:
Classification of de Bruijn-based labeled digraphs. 86-92
- Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
The probabilistic minimum dominating set problem. 93-113 - Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz:
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol. 114-130 - Timo Gschwind, Stefan Irnich, Isabel Podlinski:
Maximum weight relaxed cliques and Russian Doll Search revisited. 131-138 - Valeria Leggieri, Mohamed Haouari:
A matheuristic for the asymmetric capacitated vehicle routing problem. 139-150 - Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
The connected facility location polytope. 151-167
- Philippe Baptiste, Nicolas Bonifas:
Redundant cumulative constraints to compute preemptive bounds. 168-177 - Jacques Carlier, Aziz Moukrim, Abderrahim Sahli:
Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources. 178-194 - György Dósa, Zsolt Tuza:
Multiprofessor scheduling. 195-209 - Hanna Furmanczyk, Marek Kubale:
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines. 210-217 - Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin:
Graph multi-coloring for a job scheduling application. 218-235
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 2025-10-26 23:51 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:
