Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Fabian Egidy, Christian Glaßer, and Martin Herold. Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 44:1-44:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{egidy_et_al:LIPIcs.MFCS.2023.44, author = {Egidy, Fabian and Gla{\ss}er, Christian and Herold, Martin}, title = {{Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {44:1--44:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.44}, URN = {urn:nbn:de:0030-drops-185784}, doi = {10.4230/LIPIcs.MFCS.2023.44}, annote = {Keywords: Computational Complexity, Boolean Hierarchy, Proof Complexity, Proof Systems, Oracle Construction} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Anton Ehrmanntraut, Fabian Egidy, and Christian Glaßer. Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 45:1-45:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ehrmanntraut_et_al:LIPIcs.MFCS.2022.45, author = {Ehrmanntraut, Anton and Egidy, Fabian and Gla{\ss}er, Christian}, title = {{Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {45:1--45:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.45}, URN = {urn:nbn:de:0030-drops-168435}, doi = {10.4230/LIPIcs.MFCS.2022.45}, annote = {Keywords: computational complexity, promise classes, proof complexity, complete sets, oracle construction} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Titus Dose and Christian Glaßer. NP-Completeness, Proof Systems, and Disjoint NP-Pairs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dose_et_al:LIPIcs.STACS.2020.9, author = {Dose, Titus and Gla{\ss}er, Christian}, title = {{NP-Completeness, Proof Systems, and Disjoint NP-Pairs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.9}, URN = {urn:nbn:de:0030-drops-118707}, doi = {10.4230/LIPIcs.STACS.2020.9}, annote = {Keywords: NP-complete, propositional proof system, disjoint NP-pair, oracle} }
Published in: OASIcs, Volume 75, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)
Anita Schöbel, Julius Pätzold, and Jörg P. Müller. The Trickle-In Effect: Modeling Passenger Behavior in Delay Management. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Open Access Series in Informatics (OASIcs), Volume 75, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{schobel_et_al:OASIcs.ATMOS.2019.6, author = {Sch\"{o}bel, Anita and P\"{a}tzold, Julius and M\"{u}ller, J\"{o}rg P.}, title = {{The Trickle-In Effect: Modeling Passenger Behavior in Delay Management}}, booktitle = {19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)}, pages = {6:1--6:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-128-3}, ISSN = {2190-6807}, year = {2019}, volume = {75}, editor = {Cacchiani, Valentina and Marchetti-Spaccamela, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2019.6}, URN = {urn:nbn:de:0030-drops-114187}, doi = {10.4230/OASIcs.ATMOS.2019.6}, annote = {Keywords: Public Transport Planning, Delay Management, Integer Programming} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Titus Dose. P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dose:LIPIcs.MFCS.2019.47, author = {Dose, Titus}, title = {{P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.47}, URN = {urn:nbn:de:0030-drops-109918}, doi = {10.4230/LIPIcs.MFCS.2019.47}, annote = {Keywords: NP-complete, proof systems, disjoint NP-pair, oracle, UP} }
Published in: OASIcs, Volume 72, 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019)
Phillip Raffeck, Christian Eichler, Peter Wägemann, and Wolfgang Schröder-Preikschat. Worst-Case Energy-Consumption Analysis by Microarchitecture-Aware Timing Analysis for Device-Driven Cyber-Physical Systems. In 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019). Open Access Series in Informatics (OASIcs), Volume 72, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{raffeck_et_al:OASIcs.WCET.2019.4, author = {Raffeck, Phillip and Eichler, Christian and W\"{a}gemann, Peter and Schr\"{o}der-Preikschat, Wolfgang}, title = {{Worst-Case Energy-Consumption Analysis by Microarchitecture-Aware Timing Analysis for Device-Driven Cyber-Physical Systems}}, booktitle = {19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019)}, pages = {4:1--4:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-118-4}, ISSN = {2190-6807}, year = {2019}, volume = {72}, editor = {Altmeyer, Sebastian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2019.4}, URN = {urn:nbn:de:0030-drops-107699}, doi = {10.4230/OASIcs.WCET.2019.4}, annote = {Keywords: WCEC, WCRE, WCET, michroarchitecture analysis, whole-system analysis} }
Published in: OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
Julius Pätzold, Alexander Schiewe, and Anita Schöbel. Cost-Minimal Public Transport Planning. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Open Access Series in Informatics (OASIcs), Volume 65, pp. 8:1-8:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{patzold_et_al:OASIcs.ATMOS.2018.8, author = {P\"{a}tzold, Julius and Schiewe, Alexander and Sch\"{o}bel, Anita}, title = {{Cost-Minimal Public Transport Planning}}, booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)}, pages = {8:1--8:22}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-096-5}, ISSN = {2190-6807}, year = {2018}, volume = {65}, editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.8}, URN = {urn:nbn:de:0030-drops-97138}, doi = {10.4230/OASIcs.ATMOS.2018.8}, annote = {Keywords: Public Transport Planning, Integer Optimization, Line Planning, Vehicle Scheduling} }
Published in: OASIcs, Volume 59, 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)
Julius Pätzold, Alexander Schiewe, Philine Schiewe, and Anita Schöbel. Look-Ahead Approaches for Integrated Planning in Public Transportation. In 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). Open Access Series in Informatics (OASIcs), Volume 59, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{patzold_et_al:OASIcs.ATMOS.2017.17, author = {P\"{a}tzold, Julius and Schiewe, Alexander and Schiewe, Philine and Sch\"{o}bel, Anita}, title = {{Look-Ahead Approaches for Integrated Planning in Public Transportation}}, booktitle = {17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)}, pages = {17:1--17:16}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-042-2}, ISSN = {2190-6807}, year = {2017}, volume = {59}, editor = {D'Angelo, Gianlorenzo and Dollevoet, Twan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2017.17}, URN = {urn:nbn:de:0030-drops-78944}, doi = {10.4230/OASIcs.ATMOS.2017.17}, annote = {Keywords: line pool generation, line planning, vehicle scheduling, integrated planning, public transport} }
Published in: OASIcs, Volume 54, 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)
Julius Pätzold and Anita Schöbel. A Matching Approach for Periodic Timetabling. In 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016). Open Access Series in Informatics (OASIcs), Volume 54, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{patzold_et_al:OASIcs.ATMOS.2016.1, author = {P\"{a}tzold, Julius and Sch\"{o}bel, Anita}, title = {{A Matching Approach for Periodic Timetabling}}, booktitle = {16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)}, pages = {1:1--1:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-021-7}, ISSN = {2190-6807}, year = {2016}, volume = {54}, editor = {Goerigk, Marc and Werneck, Renato F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2016.1}, URN = {urn:nbn:de:0030-drops-65251}, doi = {10.4230/OASIcs.ATMOS.2016.1}, annote = {Keywords: PESP, Timetabling, Public Transport, Matching, Finite Dominating Set} }
Feedback for Dagstuhl Publishing