Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
1
A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility
Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I
(Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020.
Nikolaus Frohner
,
Günther Raidl
PDF
bib
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing
(Luca Pulina, Martina Seidl, eds.), volume 12178 of
Lecture Notes in Computer Science
, pages 267–276, 2020, Springer Verlag.
Friedrich Slivovsky
,
Stefan Szeider
bib
Project
Project
Project
A Time Leap Challenge for SAT-Solving
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming
(Helmut Simonis, ed.), volume 12333 of
Lecture Notes in Computer Science
, pages 267–285, 2020, Springer Verlag.
Johannes K. Fichte
,
Markus Hecher
,
Stefan Szeider
bib
Project
Project
A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem
Proceedings of PPSN XVI: Parallel Problem Solving from Nature
(Thomas Bäck, Mike Preuss, André Deutz, Hao Wang, Carola Doerr, Michael Emmerich, Heike Trautmann, eds.), volume 12270 of
LNCS
, pages 385–398, 2020, Springer.
Thomas Kaufmann
,
Matthias Horn
,
Günther Raidl
bib
DOI
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Algorithms (ESA'20)
(Fabrizio Grandoni, Peter Sanders, Grzegorz Herman, eds.), volume 173 of
LIPIcs
, pages 19:1–19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Sujoy Bhore
,
Guangping Li
,
Martin Nöllenburg
PDF
bib
Project
DOI
An Efficient Algorithm for Counting Markov Equivalent DAGs
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020
, pages 10136–10143, 2020, AAAI Press.
Robert Ganian
,
Thekla Hamm
,
Topi Talvitie
PDF
bib
Project
Balanced Independent and Dominating Sets on Colored Interval Graphs
European Workshop on Computational Geometry (EuroCG'20)
, pages 66:1–66:6, 2020.
Sujoy Bhore
,
Jan-Henrik Haunert
,
Fabian Klute
,
Guangping Li
,
Martin Nöllenburg
PDF
bib
Breaking Symmetries with RootClique and LexTopsort
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming
(Helmut Simonis, ed.), volume 12333 of
Lecture Notes in Computer Science
, pages 286–303, 2020, Springer Verlag.
Johannes K. Fichte
,
Markus Hecher
,
Stefan Szeider
bib
Project
Project
Building Large k-Cores from Sparse Graphs
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
(Javier Esparza, Daniel Kráľ, eds.), volume 170 of
Leibniz International Proceedings in Informatics (LIPIcs)
, pages 35:1–35:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
Fedor v. Fomin
,
Danil Sagunov
,
Kirill Simonov
PDF
bib
DOI
Casual Employee Scheduling with Constraint Programming and Metaheuristics
Computer Aided Systems Theory – EUROCAST 2019
(Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of
LNCS
, pages 279–287, 2020, Springer.
Nikolaus Frohner
,
Stephan Teuschl
,
Günther Raidl
PDF
bib
«
»
bib
×