Published in: LIPIcs, Volume 242, 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)
Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, and Jens Stoye. A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance. In 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 242, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{braga_et_al:LIPIcs.WABI.2022.13, author = {Braga, Mar{\'\i}lia D. V. and Brockmann, Leonie R. and Klerx, Katharina and Stoye, Jens}, title = {{A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance}}, booktitle = {22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-243-3}, ISSN = {1868-8969}, year = {2022}, volume = {242}, editor = {Boucher, Christina and Rahmann, Sven}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2022.13}, URN = {urn:nbn:de:0030-drops-170472}, doi = {10.4230/LIPIcs.WABI.2022.13}, annote = {Keywords: Comparative genomics, genome rearrangement, breakpoint distance, double-cut-and-join (DCJ) distance, double distance} }
Published in: LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021)
Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron. Local Certification of Graph Decompositions and Applications to Minor-Free Classes. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bousquet_et_al:LIPIcs.OPODIS.2021.22, author = {Bousquet, Nicolas and Feuilloley, Laurent and Pierron, Th\'{e}o}, title = {{Local Certification of Graph Decompositions and Applications to Minor-Free Classes}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-219-8}, ISSN = {1868-8969}, year = {2022}, volume = {217}, editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.22}, URN = {urn:nbn:de:0030-drops-157970}, doi = {10.4230/LIPIcs.OPODIS.2021.22}, annote = {Keywords: Local certification, proof-labeling schemes, locally checkable proofs, graph decompositions, minor-free graphs} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Jens M. Schmidt. Construction Sequences and Certifying 3-Connectedness. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 633-644, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{schmidt:LIPIcs.STACS.2010.2491, author = {Schmidt, Jens M.}, title = {{Construction Sequences and Certifying 3-Connectedness}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {633--644}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2491}, URN = {urn:nbn:de:0030-drops-24918}, doi = {10.4230/LIPIcs.STACS.2010.2491}, annote = {Keywords: Construction sequence, 3-connected graph, nested subdivisions, inductive characterization, 3-connectedness, certifying algorithm} }
Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)
Jens Baudach, Annette Chmielewski, and Uwe Clausen. Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part II). 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{baudach_et_al:DagSemProc.09261.14, author = {Baudach, Jens and Chmielewski, Annette and Clausen, Uwe}, title = {{Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part II)}}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.14}, URN = {urn:nbn:de:0030-drops-21836}, doi = {10.4230/DagSemProc.09261.14}, annote = {Keywords: Crew Scheduling, Waste Management, Integer Programming, Column Generation, Lagrangean Relaxation} }
Published in: Dagstuhl Seminar Proceedings, Volume 8102, Perspectives Workshop: Network Attack Detection and Defense (2008)
Joachim Biskup, Bernhard Hämmerli, Michael Meier, Sebastian Schmerl, Jens Tölle, and Michael Vogel. 2. 08102 Working Group – Early Warning Systems. In Perspectives Workshop: Network Attack Detection and Defense. Dagstuhl Seminar Proceedings, Volume 8102, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{biskup_et_al:DagSemProc.08102.2, author = {Biskup, Joachim and H\"{a}mmerli, Bernhard and Meier, Michael and Schmerl, Sebastian and T\"{o}lle, Jens and Vogel, Michael}, title = {{2. 08102 Working Group – Early Warning Systems}}, booktitle = {Perspectives Workshop: Network Attack Detection and Defense}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8102}, editor = {Georg Carle and Falko Dressler and Richard A. Kemmerer and Hartmut K\"{o}nig and Christopher Kruegel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08102.2}, URN = {urn:nbn:de:0030-drops-14936}, doi = {10.4230/DagSemProc.08102.2}, annote = {Keywords: Intrusion detection and prevention, attack response and countermeasures, reactive security, automated security, survivability and self-protection, ma network monitoring, flow analysis, denial of service detection and response, event correlation} }
Published in: Dagstuhl Seminar Proceedings, Volume 5462, Service Oriented Computing (SOC) (2006)
Jens Hündling. Towards A Meta-Model for Service Properties. In Service Oriented Computing (SOC). Dagstuhl Seminar Proceedings, Volume 5462, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{hundling:DagSemProc.05462.9, author = {H\"{u}ndling, Jens}, title = {{Towards A Meta-Model for Service Properties}}, booktitle = {Service Oriented Computing (SOC)}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5462}, editor = {Francisco Cubera and Bernd J. Kr\"{a}mer and Michael P. Papazoglou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05462.9}, URN = {urn:nbn:de:0030-drops-5295}, doi = {10.4230/DagSemProc.05462.9}, annote = {Keywords: Service Properties, Quality of Services, QoS, non-functional Properties, Service Discovery} }
Feedback for Dagstuhl Publishing