default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Kobler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[r1]Daniel Kobler:
Evolutionary Algorithms in Combinatorial Optimization. Encyclopedia of Optimization 2009: 950-959- 2004
- [j15]Michael U. Gerber, Daniel Kobler:
Classes of graphs that can be partitioned to satisfy all their vertices. Australas. J Comb. 29: 201-214 (2004) - 2003
- [j14]Daniel Kobler, Udi Rotics:
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. Algorithmica 37(4): 327-346 (2003) - [j13]Daniel Kobler, Udi Rotics:
Edge dominating set and colorings on graphs with fixed clique-width. Discret. Appl. Math. 126(2-3): 197-221 (2003) - [j12]Dominique de Werra, Daniel Kobler:
Coloration de graphes : fondements et applications. RAIRO Oper. Res. 37(1): 29-66 (2003) - [j11]Michael U. Gerber, Daniel Kobler:
Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theor. Comput. Sci. 299(1-3): 719-734 (2003) - 2002
- [j10]Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak:
Complexity of list coloring problems with a fixed total number of colors. Discret. Appl. Math. 117(1-3): 65-79 (2002) - [j9]Jacek Blazewicz
, Piotr Formanowicz, Marta Kasprzak, Daniel Kobler:
On the recognition of de Bruijn graphs and their induced subgraphs. Discret. Math. 245(1-3): 81-92 (2002) - [j8]Jacek Blazewicz, Daniel Kobler:
Review of properties of different precedence graphs for scheduling problems. Eur. J. Oper. Res. 142(3): 435-443 (2002) - 2001
- [j7]Daniel Kobler, André Kündgen:
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs. Electron. J. Comb. 8(1) (2001) - [c2]Daniel Kobler, Udi Rotics:
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). SODA 2001: 468-476 - 2000
- [j6]Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev:
Feasible edge colorings of trees with cardinality constraints. Discret. Math. 222(1-3): 61-72 (2000) - [j5]Michael U. Gerber, Daniel Kobler:
Algorithmic approach to the satisfactory graph partitioning problem. Eur. J. Oper. Res. 125(2): 283-291 (2000) - [j4]Alain Hertz, Daniel Kobler:
A framework for the description of evolutionary algorithms. Eur. J. Oper. Res. 126(1): 1-12 (2000)
1990 – 1999
- 1999
- [j3]Jacek Blazewicz, Alain Hertz, Daniel Kobler, Dominique de Werra:
On some Properties of DNA Graphs. Discret. Appl. Math. 98(1-2): 1-19 (1999) - [j2]Patrice Calégari, Giovanni Coray, Alain Hertz, Daniel Kobler, Pierre Kuonen:
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization. J. Heuristics 5(2): 145-158 (1999) - 1998
- [c1]Daniel Kobler, Andrea Tettamanzi:
Recombination Operators for Evolutionary Graph Drawing. PPSN 1998: 988-997 - 1997
- [j1]Patrice Calégari, Frédéric Guidec, Pierre Kuonen, Daniel Kobler:
Parallel Island-Based Genetic Algorithm for Radio Network Design. J. Parallel Distributed Comput. 47(1): 86-90 (1997) - 1991
- [i2]Daniel Kobler, Daniel Hernández:
StoL - a literate programming in SCHEME. Forschungsberichte, TU Munich FKI 157 91: x1-20x (1991) - [i1]Daniel Kobler:
Die Generierung einer stabilen Raumdarstellung. Forschungsberichte, TU Munich FKI 161 91: 1-11 (1991)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST 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:
