Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
2
On the complexity of rainbow coloring problems
Discr. Appl. Math.
, volume 246, pages 38–48, 2018.
Eduard Eiben
,
Robert Ganian
,
Juho Lauri
PDF
bib
Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments
International Transactions in Operational Research
, 2018.
Johannes Maschler
,
Günther Raidl
PDF
bib
DOI
Planar and poly-arc Lombardi drawings
J. Computational Geometry
, volume 9, number 1, pages 328–355, 2018.
Christian A. Duncan
,
David Eppstein
,
Michael T. Goodrich
,
Stephen G. Kobourov
,
Maarten Löffler
,
Martin Nöllenburg
bib
DOI
Scalable Set Visualizations (Dagstuhl Seminar 17332)
Dagstuhl Reports
, volume 7, number 8, pages 1–22, 2018.
Yifan Hu
,
Luana Micallef
,
Martin Nöllenburg
,
Peter Rodgers
bib
DOI
Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
Computers & Operations Research
, volume 96, pages 30–54, 2018.
Martin Riedler
,
Günther Raidl
PDF
bib
DOI
Solving Problems on Graphs of High Rank-Width
Algorithmica
, volume 80, number 2, pages 742–771, 2018.
Eduard Eiben
,
Robert Ganian
,
Stefan Szeider
PDF
bib
DOI
The complexity landscape of decompositional parameters for ILP
Artificial Intelligence
, volume 257, pages 61–71, 2018.
Robert Ganian
,
Sebastian Ordyniak
PDF
bib
Backdoors into heterogeneous classes of SAT and CSP
Journal of Computer and System Sciences
, volume 85, pages 38–56, 2017.
Serge Gaspers
,
Neeldhara Misra
,
Sebastian Ordyniak
,
Stefan Szeider
,
Stanislav Zivny
PDF
bib
DOI
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
ACM Transactions on Algorithms
, volume 13, number AC-TR-17-016, pages 29:1–29:32, 2017.
Robert Ganian
,
M. S. Ramanujan
,
Stefan Szeider
PDF
bib
DOI
Euclidean Greedy Drawings of Trees
Discrete and Computational Geometry
, volume 58, number 3, pages 543–579, 2017.
Martin Nöllenburg
,
Roman Prutkin
bib
DOI
«
»
bib
×