David Schindl

Orcid: 0000-0002-7009-5530

According to our database1, David Schindl authored at least 23 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Extremal Chemical Graphs for the Arithmetic-Geometric Index.
CoRR, 2024

2022
Finding k-community structures in special graph classes.
CoRR, 2022

Locally checkable problems in bounded clique-width graphs.
CoRR, 2022

Locally Checkable Problems Parameterized by Clique-Width.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Flexible job shop scheduling problem with sequence-dependent transportation constraints and setup times.
Proceedings of the Position and Communication Papers of the 16th Conference on Computer Science and Intelligence Systems, 2021

2020
On Some Subclasses of Split B<sub>1</sub>-EPG Graphs.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Optimal student sectioning on mandatory courses with various sections numbers.
Ann. Oper. Res., 2019

2018
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014.
Discret. Appl. Math., 2018

On Split B_1 B 1 -EPG Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2014
Learning Tabu Search for Combinatorial Optimization.
Proceedings of the Operations Research and Enterprise Systems, 2014

2013
Solution Methods for Fuel Supply of Trains.
INFOR Inf. Syst. Oper. Res., 2013

Course Opening, Assignment and Timetabling with Student Preferences.
Proceedings of the ICORES 2013, 2013

2012
Heuristics for a project management problem with incompatibility and assignment costs.
Comput. Optim. Appl., 2012

2010
Ant Local Search and its efficient adaptation to graph colouring.
J. Oper. Res. Soc., 2010

2009
Average distance and maximum induced forest.
J. Graph Theory, 2009

A solution method for a car fleet management problem with maintenance constraints.
J. Heuristics, 2009

Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results.
Discret. Optim., 2009

2006
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks.
Discret. Appl. Math., 2006

2005
Some new hereditary classes where graph coloring remains NP-hard.
Discret. Math., 2005

A solvable case of image reconstruction in discrete tomography.
Discret. Appl. Math., 2005

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints.
4OR, 2005

2003
Finding augmenting chains in extensions of claw-free graphs.
Inf. Process. Lett., 2003

P<sub>5</sub>-free augmenting graphs and the maximum stable set problem.
Discret. Appl. Math., 2003


  Loading...