Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, and Ziena Zeif. Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{borndorfer_et_al:LIPIcs.APPROX/RANDOM.2021.27, author = {Bornd\"{o}rfer, Ralf and Casel, Katrin and Issac, Davis and Niklanovits, Aikaterini and Schwartz, Stephan and Zeif, Ziena}, title = {{Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.27}, URN = {urn:nbn:de:0030-drops-147200}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.27}, annote = {Keywords: connected partition, Gy\H{o}ri-Lov\'{a}sz, balanced partition, approximation algorithms} }
Published in: Dagstuhl Reports, Volume 9, Issue 1 (2019)
Jan Camenisch, Ralf Küsters, Anna Lysyanskaya, and Alessandra Scafuro. Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042). In Dagstuhl Reports, Volume 9, Issue 1, pp. 88-103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{camenisch_et_al:DagRep.9.1.88, author = {Camenisch, Jan and K\"{u}sters, Ralf and Lysyanskaya, Anna and Scafuro, Alessandra}, title = {{Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042)}}, pages = {88--103}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {1}, editor = {Camenisch, Jan and K\"{u}sters, Ralf and Lysyanskaya, Anna and Scafuro, Alessandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.9.1.88}, URN = {urn:nbn:de:0030-drops-105710}, doi = {10.4230/DagRep.9.1.88}, annote = {Keywords: applied cryptography, cryptographic protocols, practical protocols, provably secure protocols, security models, universally composability} }
Published in: OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
René van Bevern, Till Fluschnik, and Oxana Yu. Tsidulko. Parameterized Algorithms and Data Reduction for Safe Convoy Routing. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Open Access Series in Informatics (OASIcs), Volume 65, pp. 10:1-10:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{vanbevern_et_al:OASIcs.ATMOS.2018.10, author = {van Bevern, Ren\'{e} and Fluschnik, Till and Tsidulko, Oxana Yu.}, title = {{Parameterized Algorithms and Data Reduction for Safe Convoy Routing}}, booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)}, pages = {10:1--10:19}, 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.10}, URN = {urn:nbn:de:0030-drops-97157}, doi = {10.4230/OASIcs.ATMOS.2018.10}, annote = {Keywords: NP-hard problem, fixed-parameter tractability, problem kernelization, shortest path, secluded solution} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, and Andrew M. Sutton. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 37:1-37:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{friedrich_et_al:LIPIcs.ESA.2017.37, author = {Friedrich, Tobias and Krohmer, Anton and Rothenberger, Ralf and Sauerwald, Thomas and Sutton, Andrew M.}, title = {{Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.37}, URN = {urn:nbn:de:0030-drops-78356}, doi = {10.4230/LIPIcs.ESA.2017.37}, annote = {Keywords: satisfiability, random structures, random SAT, power law distribution, scale-freeness, phase transitions} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Ralf Borndörfer, Markus Reuther, and Thomas Schlechte. A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 79-91, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2014.79, author = {Bornd\"{o}rfer, Ralf and Reuther, Markus and Schlechte, Thomas}, title = {{A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {79--91}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.79}, URN = {urn:nbn:de:0030-drops-47549}, doi = {10.4230/OASIcs.ATMOS.2014.79}, annote = {Keywords: Coarse-To-Fine Linear Programming, Rolling Stock Rotation Problem} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Martin Lemnian, Ralf Rückert, Steffen Rechner, Christoph Blendinger, and Matthias Müller-Hannemann. Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 122-137, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{lemnian_et_al:OASIcs.ATMOS.2014.122, author = {Lemnian, Martin and R\"{u}ckert, Ralf and Rechner, Steffen and Blendinger, Christoph and M\"{u}ller-Hannemann, Matthias}, title = {{Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {122--137}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.122}, URN = {urn:nbn:de:0030-drops-47576}, doi = {10.4230/OASIcs.ATMOS.2014.122}, annote = {Keywords: train delays, event-activity model, timing of decisions, passenger flows, passenger rerouting} }
Published in: Dagstuhl Reports, Volume 1, Issue 8 (2011)
Hubert Comom-Lundh, Ralf Küsters, and Catherine Meadows. Security and Rewriting (Dagstuhl Seminar 11332). In Dagstuhl Reports, Volume 1, Issue 8, pp. 53-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@Article{comomlundh_et_al:DagRep.1.8.53, author = {Comom-Lundh, Hubert and K\"{u}sters, Ralf and Meadows, Catherine}, title = {{Security and Rewriting (Dagstuhl Seminar 11332)}}, pages = {53--66}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2011}, volume = {1}, number = {8}, editor = {Comom-Lundh, Hubert and K\"{u}sters, Ralf and Meadows, Catherine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.8.53}, URN = {urn:nbn:de:0030-drops-33111}, doi = {10.4230/DagRep.1.8.53}, annote = {Keywords: Rewriting, Security, Access Control, Protocol Verification} }
Published in: Dagstuhl Seminar Proceedings, Volume 9201, Self-Healing and Self-Adaptive Systems (2009)
Ralf Koenig, Elaine Wong, and Gregoire Danoy. Progressive automation to gain appropriate trust in management automation systems. In Self-Healing and Self-Adaptive Systems. Dagstuhl Seminar Proceedings, Volume 9201, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{koenig_et_al:DagSemProc.09201.7, author = {Koenig, Ralf and Wong, Elaine and Danoy, Gregoire}, title = {{Progressive automation to gain appropriate trust in management automation systems}}, booktitle = {Self-Healing and Self-Adaptive Systems}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9201}, editor = {Artur Andrzejak and Kurt Geihs and Onn Shehory and John Wilkes}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09201.7}, URN = {urn:nbn:de:0030-drops-20988}, doi = {10.4230/DagSemProc.09201.7}, annote = {Keywords: Systems and network management, aircraft maintenance management, automation, self-managing systems, autonomic systems, trust} }
Published in: OASIcs, Volume 7, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) (2007)
Ralf Borndörfer and Thomas Schlechte. 05. Models for Railway Track Allocation. In 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07). Open Access Series in Informatics (OASIcs), Volume 7, pp. 62-78, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2007.1170, author = {Bornd\"{o}rfer, Ralf and Schlechte, Thomas}, title = {{05. Models for Railway Track Allocation}}, booktitle = {7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)}, pages = {62--78}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-04-0}, ISSN = {2190-6807}, year = {2007}, volume = {7}, editor = {Ahuja, Ravindra K. and Liebchen, Christian and Mesa, Juan A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2007.1170}, URN = {urn:nbn:de:0030-drops-11701}, doi = {10.4230/OASIcs.ATMOS.2007.1170}, annote = {Keywords: Track allocation, train timetabling,integer programming, column generation} }
Feedback for Dagstuhl Publishing