Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Nina Klobas, George B. Mertzios, Hendrik Molter, and Paul G. Spirakis. The Complexity of Computing Optimum Labelings for Temporal Connectivity. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 62:1-62:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{klobas_et_al:LIPIcs.MFCS.2022.62, author = {Klobas, Nina and Mertzios, George B. and Molter, Hendrik and Spirakis, Paul G.}, title = {{The Complexity of Computing Optimum Labelings for Temporal Connectivity}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {62:1--62: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.62}, URN = {urn:nbn:de:0030-drops-168603}, doi = {10.4230/LIPIcs.MFCS.2022.62}, annote = {Keywords: Temporal graph, graph labeling, foremost temporal path, temporal connectivity, Steiner Tree} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, and Philipp Zschoche. The Complexity of Transitively Orienting Temporal Graphs. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 75:1-75:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{mertzios_et_al:LIPIcs.MFCS.2021.75, author = {Mertzios, George B. and Molter, Hendrik and Renken, Malte and Spirakis, Paul G. and Zschoche, Philipp}, title = {{The Complexity of Transitively Orienting Temporal Graphs}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {75:1--75:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.75}, URN = {urn:nbn:de:0030-drops-145157}, doi = {10.4230/LIPIcs.MFCS.2021.75}, annote = {Keywords: Temporal graph, transitive orientation, transitive closure, polynomial-time algorithm, NP-hardness, satisfiability} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, and Philipp Zschoche. Computing Maximum Matchings in Temporal Graphs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{mertzios_et_al:LIPIcs.STACS.2020.27, author = {Mertzios, George B. and Molter, Hendrik and Niedermeier, Rolf and Zamaraev, Viktor and Zschoche, Philipp}, title = {{Computing Maximum Matchings in Temporal Graphs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {27:1--27:14}, 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.27}, URN = {urn:nbn:de:0030-drops-118881}, doi = {10.4230/LIPIcs.STACS.2020.27}, annote = {Keywords: Temporal Graph, Link Stream, Temporal Line Graph, NP-hardness, APX-hardness, Approximation Algorithm, Fixed-parameter Tractability, Independent Set} }
Published in: LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Junjie Luo, Hendrik Molter, and Ondrej Suchý. A Parameterized Complexity View on Collapsing k-Cores. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{luo_et_al:LIPIcs.IPEC.2018.7, author = {Luo, Junjie and Molter, Hendrik and Such\'{y}, Ondrej}, title = {{A Parameterized Complexity View on Collapsing k-Cores}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {7:1--7:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.7}, URN = {urn:nbn:de:0030-drops-102088}, doi = {10.4230/LIPIcs.IPEC.2018.7}, annote = {Keywords: r-Degenerate Vertex Deletion, Feedback Vertex Set, Fixed-Parameter Tractability, Kernelization Lower Bounds, Graph Algorithms, Social Network Analysis} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondrej Suchý. Finding Secluded Places of Special Interest in Graphs. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{vanbevern_et_al:LIPIcs.IPEC.2016.5, author = {van Bevern, Ren\'{e} and Fluschnik, Till and Mertzios, George B. and Molter, Hendrik and Sorge, Manuel and Such\'{y}, Ondrej}, title = {{Finding Secluded Places of Special Interest in Graphs}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.5}, URN = {urn:nbn:de:0030-drops-69380}, doi = {10.4230/LIPIcs.IPEC.2016.5}, annote = {Keywords: Neighborhood, Feedback Vertex Set, Vertex Deletion, Separator, Dominating Set} }
Published in: Dagstuhl Seminar Proceedings, Volume 6431, Scalable Data Management in Evolving Networks (2007)
Sebastian Obermeier, Joos-Hendrik Böse, Stefan Böttcher, Panos Kypros Chrysanthis, Alex Delis, Le Gruenwald, Anirban Mondal, Aris Ouksel, George Samaras, and Stratis Viglas. 06431 Working Group Summary: Atomicity in Mobile Networks. In Scalable Data Management in Evolving Networks. Dagstuhl Seminar Proceedings, Volume 6431, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{obermeier_et_al:DagSemProc.06431.4, author = {Obermeier, Sebastian and B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Chrysanthis, Panos Kypros and Delis, Alex and Gruenwald, Le and Mondal, Anirban and Ouksel, Aris and Samaras, George and Viglas, Stratis}, title = {{06431 Working Group Summary: Atomicity in Mobile Networks}}, booktitle = {Scalable Data Management in Evolving Networks}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6431}, editor = {Stefan B\"{o}ttcher and Le Gruenwald and Pedro Jose Marr\'{o}n and Evaggelia Pitoura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06431.4}, URN = {urn:nbn:de:0030-drops-9521}, doi = {10.4230/DagSemProc.06431.4}, annote = {Keywords: Mobile ad noc networks, mobile databases, mobile transactions, atomicity} }
Published in: Dagstuhl Seminar Proceedings, Volume 6431, Scalable Data Management in Evolving Networks (2007)
Peter A. Boncz, Angela Bonifati, Joos-Hendrik Böse, Stefan Böttcher, Panos Kypros Chrysanthis, Le Gruenwald, Arantza Illarramendi, Peter Janacik, Birgitta König-Ries, Wolfgang May, Anirban Mondal, Sebastian Obermeier, Aris Ouksel, and George Samaras. 06431 Working Group Summary: P2P, Ad Hoc and Sensor Networks – All the Different or All the Same?. In Scalable Data Management in Evolving Networks. Dagstuhl Seminar Proceedings, Volume 6431, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{boncz_et_al:DagSemProc.06431.5, author = {Boncz, Peter A. and Bonifati, Angela and B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Chrysanthis, Panos Kypros and Gruenwald, Le and Illarramendi, Arantza and Janacik, Peter and K\"{o}nig-Ries, Birgitta and May, Wolfgang and Mondal, Anirban and Obermeier, Sebastian and Ouksel, Aris and Samaras, George}, title = {{06431 Working Group Summary: P2P, Ad Hoc and Sensor Networks – All the Different or All the Same?}}, booktitle = {Scalable Data Management in Evolving Networks}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6431}, editor = {Stefan B\"{o}ttcher and Le Gruenwald and Pedro Jose Marr\'{o}n and Evaggelia Pitoura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06431.5}, URN = {urn:nbn:de:0030-drops-9514}, doi = {10.4230/DagSemProc.06431.5}, annote = {Keywords: P2P, ad hoc, wireless sensor networks, database systems} }
Published in: Dagstuhl Seminar Proceedings, Volume 4441, Mobile Information Management (2005)
Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Pedro Jóse Marrón, Philipp Obreiter, Evaggelia Pitoura, Peter Reiher, Kai-Uwe Sattler, and Frank Seliger. 04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems. In Mobile Information Management. Dagstuhl Seminar Proceedings, Volume 4441, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{bose_et_al:DagSemProc.04441.3, author = {B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Gruenwald, Le and Marr\'{o}n, Pedro J\'{o}se and Obreiter, Philipp and Pitoura, Evaggelia and Reiher, Peter and Sattler, Kai-Uwe and Seliger, Frank}, title = {{04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems}}, booktitle = {Mobile Information Management}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4441}, editor = {Margaret H. Dunham and Birgitta K\"{o}nig-Ries and Evaggelia Pitoura and Peter Reiher and Can T\"{u}rker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04441.3}, URN = {urn:nbn:de:0030-drops-2171}, doi = {10.4230/DagSemProc.04441.3}, annote = {Keywords: MANET, P2P} }
Published in: Dagstuhl Seminar Proceedings, Volume 4441, Mobile Information Management (2005)
Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Evaggelia Pitoura, Peter Reiher, George Samaras, Thomas Schwarz, and Can Türker. 04441 Working Group – Research Issues in Mobile Transactions. In Mobile Information Management. Dagstuhl Seminar Proceedings, Volume 4441, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{bose_et_al:DagSemProc.04441.7, author = {B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Gruenwald, Le and Pitoura, Evaggelia and Reiher, Peter and Samaras, George and Schwarz, Thomas and T\"{u}rker, Can}, title = {{04441 Working Group – Research Issues in Mobile Transactions}}, booktitle = {Mobile Information Management}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4441}, editor = {Margaret H. Dunham and Birgitta K\"{o}nig-Ries and Evaggelia Pitoura and Peter Reiher and Can T\"{u}rker}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04441.7}, URN = {urn:nbn:de:0030-drops-1685}, doi = {10.4230/DagSemProc.04441.7}, annote = {Keywords: Transactions , mobile clients , multi-hop wireless networks} }
Feedback for Dagstuhl Publishing