Daniel Kobler

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3059317	2010-12-08	Paper
Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size	2005-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q4820779	2004-10-01	Paper
Coloration de graphes : fondements et applications	2004-08-30	Paper
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.	2003-05-25	Paper
Edge dominating set and colorings on graphs with fixed clique-width	2003-03-09	Paper
Review of properties of different precedence graphs for scheduling problems	2002-11-17	Paper
On the recognition of de Bruijn graphs and their induced subgraphs	2002-05-15	Paper
Complexity of list coloring problems with a fixed total number of colors	2002-05-15	Paper
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)	2002-03-14	Paper
Feasible edge colorings of trees with cardinality constraints	2001-06-28	Paper
Gaps in the chromatic spectrum of face-constrained plane graphs	2001-05-15	Paper
Algorithmic approach to the satisfactory graph partitioning problem	2000-11-23	Paper
A framework for the description of evolutionary algorithms	2000-11-05	Paper
On some properties of DNA graphs	2000-06-29	Paper

This page was built for person: Daniel Kobler