|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 9 keywords
|
|
|
|
|
Results
Found 36 publication records. Showing 36 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu |
On the online track assignment problem.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yerim Chung, Jean-François Culus, Marc Demange |
On Inverse Chromatic Number problems (Extended abstract). |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Tinaz Ekim, Dominique de Werra |
A tutorial on the use of graph coloring for some problems in robotics. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu |
Online Bounded Coloring of Permutation and Overlap Graphs. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yerim Chung, Marc Demange |
Some Inverse Traveling Salesman Problems. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yerim Chung, Marc Demange |
The 0-1 inverse maximum stable set problem. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Tinaz Ekim |
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
unmatched pairs, Minimum Maximal Matching, regular bipartite graphs, stable marriage |
| 1 | Yerim Chung, Jean-François Culus, Marc Demange |
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
Inverse combinatorial optimization, Inverse chromatic number problem, Machine(s)-scheduling with earliness and or tardiness costs, Approximation, NP-hardness, Interval graphs |
| 1 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Time slot scheduling of compatible jobs. |
J. Scheduling |
2007 |
DBLP DOI BibTeX RDF |
Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling |
| 1 | Marc Demange, Tinaz Ekim, Dominique de Werra |
On the approximation of Min Split-coloring and Min Cocoloring. |
J. Graph Algorithms Appl. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jean-François Culus, Marc Demange |
Oriented Coloring: Complexity and Approximation. |
SOFSEM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Tinaz Ekim, Dominique de Werra |
(p, k)-coloring problems in line graphs. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Tinaz Ekim, Dominique de Werra |
Partitioning cographs into cliques and stable sets. |
Discrete Optimization |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Tinaz Ekim, Dominique de Werra |
(p, k)-coloring problems in line graphs. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
On-line vertex-covering. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
Completeness in differential approximation classes. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Polynomial approximation algorithms with performance guarantees: An introduction-by-example. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Improved Approximations for Weighted and Unweighted Graph Problems. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
A hypocoloring model for batch scheduling. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Bernard Kouakou, Éric Soutif |
On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
hereditary property, on-line algorithm, competitivity ratio, independent set |
| 1 | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos |
Algorithms for the On-Line Quota Traveling Salesman Problem. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos |
Algorithms for the On-Line Quota Traveling Salesman Problem. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
Differential approximation results for the Steiner tree problem. |
Appl. Math. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
Completeness in Differential Approximation Classes. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances. |
RAIRO - Operations Research |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation. |
RAIRO - Operations Research |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Node Coloring: When Stable Sets Are Expensive. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Algorithms and Models for the On-Line Vertex-Covering. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Xavier Paradon, Vangelis Th. Paschos |
On-Line Maximum-Order Induces Hereditary Subgraph Problems. |
SOFSEM |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Pascal Grisoni, Vangelis Th. Paschos |
Differential Approximation Algorithms for Some Combinatorial Optimization Problems. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Constructive - Non-constructive Approximation and Maximum Independent Set Problem. |
Combinatorics and Computer Science |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Pascal Grisoni, Vangelis Th. Paschos |
Approximation Results for the Minimum Graph Coloring Problem. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #36 of 36 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")