default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Schindl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Narmina Baghirova
, Clément Dallard, Bernard Ries, David Schindl:
Finding k-community structures in special graph classes. Discret. Appl. Math. 359: 159-175 (2024)- [c7]Vera Fischer, Antoine Legrain, David Schindl:
A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities. CPAIOR (1) 2024: 277-292 - [i3]Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl:
Extremal Chemical Graphs for the Arithmetic-Geometric Index. CoRR abs/2403.05226 (2024) - 2022
- [c6]Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl:
Locally Checkable Problems Parameterized by Clique-Width. ISAAC 2022: 31:1-31:20 - [i2]Narmina Baghirova, Carolina Lucía Gonzalez, David Schindl:
Locally checkable problems in bounded clique-width graphs. CoRR abs/2203.02992 (2022) - [i1]Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl:
Finding k-community structures in special graph classes. CoRR abs/2206.14738 (2022) - 2021
- [c5]Sacha Varone, David Schindl, Corentin Beffa:
Flexible job shop scheduling problem with sequence-dependent transportation constraints and setup times. FedCSIS (Position Papers) 2021: 97-102 - 2020
- [c4]Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Some Subclasses of Split B1-EPG Graphs. LATIN 2020: 625-636
2010 – 2019
- 2019
- [j14]David Schindl:
Optimal student sectioning on mandatory courses with various sections numbers. Ann. Oper. Res. 275(1): 209-221 (2019) - 2018
- [j13]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. Discret. Appl. Math. 234: 1-2 (2018) - [c3]Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Split B_1 B 1 -EPG Graphs. LATIN 2018: 361-375 - 2014
- [c2]Nicolas Zufferey, David Schindl:
Learning Tabu Search for Combinatorial Optimization. ICORES (Selected Papers) 2014: 3-11 - 2013
- [j12]David Schindl, Nicolas Zufferey:
Solution Methods for Fuel Supply of Trains. INFOR Inf. Syst. Oper. Res. 51(1): 23-30 (2013) - [c1]Sacha Varone, David Schindl:
Course Opening, Assignment and Timetabling with Student Preferences. ICORES 2013: 153-158 - 2012
- [j11]Nicolas Zufferey, Olivier Labarthe, David Schindl:
Heuristics for a project management problem with incompatibility and assignment costs. Comput. Optim. Appl. 51(3): 1231-1252 (2012) - 2010
- [j10]Matthieu Plumettaz, David Schindl, Nicolas Zufferey:
Ant Local Search and its efficient adaptation to graph colouring. J. Oper. Res. Soc. 61(5): 819-826 (2010)
2000 – 2009
- 2009
- [j9]Pierre Hansen, Martine Labbé, David Schindl:
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discret. Optim. 6(2): 135-147 (2009) - [j8]Alain Hertz, David Schindl, Nicolas Zufferey:
A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15(5): 425-450 (2009) - [j7]Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl:
Average distance and maximum induced forest. J. Graph Theory 60(1): 31-54 (2009) - 2006
- [j6]T. Bornand-Jaccard, David Schindl, Dominique de Werra:
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks. Discret. Appl. Math. 154(8): 1223-1235 (2006) - 2005
- [j5]Alain Hertz, David Schindl, Nicolas Zufferey:
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2): 139-161 (2005) - [j4]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, David Schindl:
A solvable case of image reconstruction in discrete tomography. Discret. Appl. Math. 148(3): 240-245 (2005) - [j3]David Schindl:
Some new hereditary classes where graph coloring remains NP-hard. Discret. Math. 295(1-3): 197-202 (2005) - 2003
- [j2]Michael U. Gerber, Alain Hertz, David Schindl:
P5-free augmenting graphs and the maximum stable set problem. Discret. Appl. Math. 132(1-3): 109-119 (2003) - [j1]Alain Hertz, Vadim V. Lozin, David Schindl:
Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. 86(6): 311-316 (2003)
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-12-10 20:43 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:
