Published in: LIPIcs, Volume 270, 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)
Elaine Pimentel and Luiz Carlos Pereira. A Tour on Ecumenical Systems (Invited Talk). In 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 270, pp. 3:1-3:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{pimentel_et_al:LIPIcs.CALCO.2023.3, author = {Pimentel, Elaine and Pereira, Luiz Carlos}, title = {{A Tour on Ecumenical Systems}}, booktitle = {10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-287-7}, ISSN = {1868-8969}, year = {2023}, volume = {270}, editor = {Baldan, Paolo and de Paiva, Valeria}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2023.3}, URN = {urn:nbn:de:0030-drops-188003}, doi = {10.4230/LIPIcs.CALCO.2023.3}, annote = {Keywords: Intuitionistic logic, classical logic, modal logic, ecumenical systems, proof theory} }
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, and Leo Wendt. Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 10:1-10:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{angrick_et_al:LIPIcs.SEA.2023.10, author = {Angrick, Sebastian and Bals, Ben and Casel, Katrin and Cohen, Sarel and Friedrich, Tobias and Hastrich, Niko and Hradilak, Theresa and Issac, Davis and Ki{\ss}ig, Otto and Schmidt, Jonas and Wendt, Leo}, title = {{Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.10}, URN = {urn:nbn:de:0030-drops-183602}, doi = {10.4230/LIPIcs.SEA.2023.10}, annote = {Keywords: directed feedback vertex set, vertex cover, reduction rules} }
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Ernestine Großmann, Jonas Sauer, Christian Schulz, and Patrick Steil. Arc-Flags Meet Trip-Based Public Transit Routing. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 16:1-16:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{gromann_et_al:LIPIcs.SEA.2023.16, author = {Gro{\ss}mann, Ernestine and Sauer, Jonas and Schulz, Christian and Steil, Patrick}, title = {{Arc-Flags Meet Trip-Based Public Transit Routing}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.16}, URN = {urn:nbn:de:0030-drops-183664}, doi = {10.4230/LIPIcs.SEA.2023.16}, annote = {Keywords: Public transit routing, graph algorithms, algorithm engineering} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Andreas S. Schulz and Rajan Udwani. Robust Appointment Scheduling with Heterogeneous Costs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 25:1-25:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{schulz_et_al:LIPIcs.APPROX-RANDOM.2019.25, author = {Schulz, Andreas S. and Udwani, Rajan}, title = {{Robust Appointment Scheduling with Heterogeneous Costs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.25}, URN = {urn:nbn:de:0030-drops-112407}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.25}, annote = {Keywords: Appointment scheduling, approximation algorithms, robust optimization} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Andreas S. Schulz and José Verschae. Min-Sum Scheduling Under Precedence Constraints. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 74:1-74:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{schulz_et_al:LIPIcs.ESA.2016.74, author = {Schulz, Andreas S. and Verschae, Jos\'{e}}, title = {{Min-Sum Scheduling Under Precedence Constraints}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {74:1--74:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.74}, URN = {urn:nbn:de:0030-drops-64157}, doi = {10.4230/LIPIcs.ESA.2016.74}, annote = {Keywords: scheduling, approximation algorithms, linear programming relaxations, precedence constraints} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Shashi Mittal, Andreas S. Schulz, and Sebastian Stiller. Robust Appointment Scheduling. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 356-370, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{mittal_et_al:LIPIcs.APPROX-RANDOM.2014.356, author = {Mittal, Shashi and Schulz, Andreas S. and Stiller, Sebastian}, title = {{Robust Appointment Scheduling}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {356--370}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.356}, URN = {urn:nbn:de:0030-drops-47089}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.356}, annote = {Keywords: Robust Optimization, Health Care Scheduling, Approximation Algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)
Andreas S. Schulz and Nelson A. Uhan. Sharing Supermodular Costs. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{schulz_et_al:DagSemProc.09261.27, author = {Schulz, Andreas S. and Uhan, Nelson A.}, title = {{Sharing Supermodular Costs}}, booktitle = {Models and Algorithms for Optimization in Logistics}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9261}, editor = {Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.27}, URN = {urn:nbn:de:0030-drops-21702}, doi = {10.4230/DagSemProc.09261.27}, annote = {Keywords: Cooperative games, approximation algorithms, algorithmic game theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Andreas S. Schulz. New Old Algorithms for Stochastic Scheduling. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2005)
@InProceedings{schulz:DagSemProc.05031.18, author = {Schulz, Andreas S.}, title = {{New Old Algorithms for Stochastic Scheduling}}, booktitle = {Algorithms for Optimization with Incomplete Information}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5031}, editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.18}, URN = {urn:nbn:de:0030-drops-1931}, doi = {10.4230/DagSemProc.05031.18}, annote = {Keywords: stochastic scheduling , online algorithms , competitive analysis , approximation algorithms , linear programming relaxations} }
Feedback for Dagstuhl Publishing