Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Elchanan Solomon, Alexander Wagner, and Paul Bendich. From Geometry to Topology: Inverse Theorems for Distributed Persistence. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 61:1-61:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{solomon_et_al:LIPIcs.SoCG.2022.61, author = {Solomon, Elchanan and Wagner, Alexander and Bendich, Paul}, title = {{From Geometry to Topology: Inverse Theorems for Distributed Persistence}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {61:1--61:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.61}, URN = {urn:nbn:de:0030-drops-160690}, doi = {10.4230/LIPIcs.SoCG.2022.61}, annote = {Keywords: Applied Topology, Persistent Homology, Inverse Problems, Subsampling} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Steven Chaplick, Henry Förster, Myroslav Kryven, and Alexander Wolff. Drawing Graphs with Circular Arcs and Right-Angle Crossings. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chaplick_et_al:LIPIcs.SWAT.2020.21, author = {Chaplick, Steven and F\"{o}rster, Henry and Kryven, Myroslav and Wolff, Alexander}, title = {{Drawing Graphs with Circular Arcs and Right-Angle Crossings}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.21}, URN = {urn:nbn:de:0030-drops-122687}, doi = {10.4230/LIPIcs.SWAT.2020.21}, annote = {Keywords: circular arcs, right-angle crossings, edge density, charging argument} }
Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)
Alexander Tiskin. Bounded-Length Smith-Waterman Alignment. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 16:1-16:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{tiskin:LIPIcs.WABI.2019.16, author = {Tiskin, Alexander}, title = {{Bounded-Length Smith-Waterman Alignment}}, booktitle = {19th International Workshop on Algorithms in Bioinformatics (WABI 2019)}, pages = {16:1--16:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-123-8}, ISSN = {1868-8969}, year = {2019}, volume = {143}, editor = {Huber, Katharina T. and Gusfield, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.16}, URN = {urn:nbn:de:0030-drops-110461}, doi = {10.4230/LIPIcs.WABI.2019.16}, annote = {Keywords: sequence alignment, local alignment, Smith, Waterman alignment, matrix searching} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Alfredo Hubard, Vojtech Kaluža, Arnaud de Mesmay, and Martin Tancer. Shortest Path Embeddings of Graphs on Surfaces. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 43:1-43:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{hubard_et_al:LIPIcs.SoCG.2016.43, author = {Hubard, Alfredo and Kalu\v{z}a, Vojtech and de Mesmay, Arnaud and Tancer, Martin}, title = {{Shortest Path Embeddings of Graphs on Surfaces}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {43:1--43:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.43}, URN = {urn:nbn:de:0030-drops-59356}, doi = {10.4230/LIPIcs.SoCG.2016.43}, annote = {Keywords: Graph embedding, surface, shortest path, crossing number, hyperbolic geometry} }
Published in: LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Magnús M. Halldórsson and Tigran Tonoyan. The Price of Local Power Control in Wireless Scheduling. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 529-542, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{halldorsson_et_al:LIPIcs.FSTTCS.2015.529, author = {Halld\'{o}rsson, Magn\'{u}s M. and Tonoyan, Tigran}, title = {{The Price of Local Power Control in Wireless Scheduling}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {529--542}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.529}, URN = {urn:nbn:de:0030-drops-56243}, doi = {10.4230/LIPIcs.FSTTCS.2015.529}, annote = {Keywords: Wireless Scheduling, Physical Model, Oblivious Power} }
Published in: LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, and Alexander S. Kulikov. Parameterized Complexity of Secluded Connectivity Problems. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 408-419, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{fomin_et_al:LIPIcs.FSTTCS.2015.408, author = {Fomin, Fedor V. and Golovach, Petr A. and Karpov, Nikolay and Kulikov, Alexander S.}, title = {{Parameterized Complexity of Secluded Connectivity Problems}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {408--419}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.408}, URN = {urn:nbn:de:0030-drops-56318}, doi = {10.4230/LIPIcs.FSTTCS.2015.408}, annote = {Keywords: Secluded path, Secluded Steiner tree, parameterized complexity} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Tobias Mömke. Complexity and Approximability of Parameterized MAX-CSPs. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 294-306, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{dell_et_al:LIPIcs.IPEC.2015.294, author = {Dell, Holger and Kim, Eun Jung and Lampis, Michael and Mitsou, Valia and M\"{o}mke, Tobias}, title = {{Complexity and Approximability of Parameterized MAX-CSPs}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {294--306}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.294}, URN = {urn:nbn:de:0030-drops-55910}, doi = {10.4230/LIPIcs.IPEC.2015.294}, annote = {Keywords: Approximation, Structural Parameters, Constraint Satisfaction} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Santosh Nagarakatte, Milo M. K. Martin, and Steve Zdancewic. Everything You Want to Know About Pointer-Based Checking. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 190-208, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{nagarakatte_et_al:LIPIcs.SNAPL.2015.190, author = {Nagarakatte, Santosh and Martin, Milo M. K. and Zdancewic, Steve}, title = {{Everything You Want to Know About Pointer-Based Checking}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {190--208}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.190}, URN = {urn:nbn:de:0030-drops-50268}, doi = {10.4230/LIPIcs.SNAPL.2015.190}, annote = {Keywords: Memory safety, Buffer overflows, Dangling pointers, Pointer-based checking, SoftBoundCETS} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Jan Hazla and Thomas Holenstein. Upper Tail Estimates with Combinatorial Proofs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 392-405, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hazla_et_al:LIPIcs.STACS.2015.392, author = {Hazla, Jan and Holenstein, Thomas}, title = {{Upper Tail Estimates with Combinatorial Proofs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {392--405}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.392}, URN = {urn:nbn:de:0030-drops-49291}, doi = {10.4230/LIPIcs.STACS.2015.392}, annote = {Keywords: concentration bounds, expander random walks, polynomial concentration} }
Published in: Dagstuhl Seminar Proceedings, Volume 5361, Algorithmic Aspects of Large and Complex Networks (2006)
Sándor Fekete, Alexander Kröller, Dennis Pfisterer, and Stefan Fischer. Deterministic boundary recongnition and topology extraction for large sensor networks. In Algorithmic Aspects of Large and Complex Networks. Dagstuhl Seminar Proceedings, Volume 5361, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{fekete_et_al:DagSemProc.05361.6, author = {Fekete, S\'{a}ndor and Kr\"{o}ller, Alexander and Pfisterer, Dennis and Fischer, Stefan}, title = {{Deterministic boundary recongnition and topology extraction for large sensor networks}}, booktitle = {Algorithmic Aspects of Large and Complex Networks}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5361}, editor = {Stefano Leonardi and Friedhelm Meyer auf der Heide and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05361.6}, URN = {urn:nbn:de:0030-drops-5632}, doi = {10.4230/DagSemProc.05361.6}, annote = {Keywords: Distributed algorithms, sensor networks, boundary recognition, topology extraction} }
Feedback for Dagstuhl Publishing