@Proceedings{marion_et_al:LIPIcs.STACS.2010,
title = {{LIPIcs, Volume 5, STACS'10, Complete Volume}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-16-3},
ISSN = {1868-8969},
year = {2013},
volume = {5},
editor = {Marion, Jean-Yves and Schwentick, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010},
URN = {urn:nbn:de:0030-drops-40996},
doi = {10.4230/LIPIcs.STACS.2010},
annote = {Keywords: LIPIcs, Volume 5, STACS'10, Complete Volume}
}
@InProceedings{marion_et_al:LIPIcs.STACS.2010.2439,
author = {Marion, Jean-Yves and Schwentick, Thomas},
title = {{Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {i--vi},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2439},
URN = {urn:nbn:de:0030-drops-24393},
doi = {10.4230/LIPIcs.STACS.2010.2439},
annote = {Keywords: Foreword}
}
@InProceedings{marion_et_al:LIPIcs.STACS.2010.2505,
author = {Marion, Jean-Yves and Schwentick, Thomas},
title = {{Table of Contents -- 27th International Symposium on Theoretical Aspects of Computer Science}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {7--10},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2505},
URN = {urn:nbn:de:0030-drops-25059},
doi = {10.4230/LIPIcs.STACS.2010.2505},
annote = {Keywords: Table of contents}
}
@InProceedings{bojanczyk:LIPIcs.STACS.2010.2440,
author = {Bojanczyk, Mikolaj},
title = {{Beyond omega-Regular Languages}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {11--16},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2440},
URN = {urn:nbn:de:0030-drops-24409},
doi = {10.4230/LIPIcs.STACS.2010.2440},
annote = {Keywords: Automata, monadic second-order logic}
}
@InProceedings{niedermeier:LIPIcs.STACS.2010.2495,
author = {Niedermeier, Rolf},
title = {{Reflections on Multivariate Algorithmics and Problem Parameterization}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {17--32},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2495},
URN = {urn:nbn:de:0030-drops-24952},
doi = {10.4230/LIPIcs.STACS.2010.2495},
annote = {Keywords: Multivariate algorithmics, problem parameterization}
}
@InProceedings{stern:LIPIcs.STACS.2010.2441,
author = {Stern, Jacques},
title = {{Mathematics, Cryptology, Security}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {33--34},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2441},
URN = {urn:nbn:de:0030-drops-24416},
doi = {10.4230/LIPIcs.STACS.2010.2441},
annote = {Keywords: Mathematics, Cryptology, Security}
}
@InProceedings{adamaszek_et_al:LIPIcs.STACS.2010.2442,
author = {Adamaszek, Anna and Adamaszek, Michal},
title = {{Large-Girth Roots of Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {35--46},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2442},
URN = {urn:nbn:de:0030-drops-24429},
doi = {10.4230/LIPIcs.STACS.2010.2442},
annote = {Keywords: Graph roots, Graph powers, NP-completeness, Recognition algorithms}
}
@InProceedings{allamigeon_et_al:LIPIcs.STACS.2010.2443,
author = {Allamigeon, Xavier and Gaubert, St\'{e}phane and Goubault, \'{E}ric},
title = {{The Tropical Double Description Method}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {47--58},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2443},
URN = {urn:nbn:de:0030-drops-24435},
doi = {10.4230/LIPIcs.STACS.2010.2443},
annote = {Keywords: Convexity in tropical algebra, algorithmics and combinatorics of tropical polyhedra, computational geometry, discrete event systems, static analysis}
}
@InProceedings{arvind_et_al:LIPIcs.STACS.2010.2444,
author = {Arvind, Vikraman and Srinivasan, Srikanth},
title = {{The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {59--70},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2444},
URN = {urn:nbn:de:0030-drops-24449},
doi = {10.4230/LIPIcs.STACS.2010.2444},
annote = {Keywords: Small Bias Spaces, Expander Graphs, Cayley Graphs, Remote Point Problem}
}
@InProceedings{babai_et_al:LIPIcs.STACS.2010.2445,
author = {Babai, L\'{a}szl\'{o} and Banerjee, Anandam and Kulkarni, Raghav and Naik, Vipul},
title = {{Evasiveness and the Distribution of Prime Numbers}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {71--82},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2445},
URN = {urn:nbn:de:0030-drops-24451},
doi = {10.4230/LIPIcs.STACS.2010.2445},
annote = {Keywords: Decision tree complexity, evasiveness, graph property, group action, Dirichlet primes, Extended Riemann Hypothesis}
}
@InProceedings{bienkowski_et_al:LIPIcs.STACS.2010.2446,
author = {Bienkowski, Marcin and Klonowski, Marek and Korzeniowski, Miroslaw and Kowalski, Dariusz R.},
title = {{Dynamic Sharing of a Multiple Access Channel}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {83--94},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2446},
URN = {urn:nbn:de:0030-drops-24467},
doi = {10.4230/LIPIcs.STACS.2010.2446},
annote = {Keywords: Distributed algorithms, multiple access channel, mutual exclusion}
}
@InProceedings{bjorklund:LIPIcs.STACS.2010.2447,
author = {Bj\"{o}rklund, Andreas},
title = {{Exact Covers via Determinants}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {95--106},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2447},
URN = {urn:nbn:de:0030-drops-24474},
doi = {10.4230/LIPIcs.STACS.2010.2447},
annote = {Keywords: Moderately Exponential Time Algorithms, Exact Set Cover, \$k\$-Dimensional Matching}
}
@InProceedings{brandt_et_al:LIPIcs.STACS.2010.2448,
author = {Brandt, Felix and Fischer, Felix and Holzer, Markus},
title = {{On Iterated Dominance, Matrix Elimination, and Matched Paths}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {107--118},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2448},
URN = {urn:nbn:de:0030-drops-24485},
doi = {10.4230/LIPIcs.STACS.2010.2448},
annote = {Keywords: Algorithmic Game Theory, Computational Complexity, Iterated Dominance, Matching}
}
@InProceedings{braverman_et_al:LIPIcs.STACS.2010.2449,
author = {Braverman, Vladimir and Chung, Kai-Min and Liu, Zhenming and Mitzenmacher, Michael and Ostrovsky, Rafail},
title = {{AMS Without 4-Wise Independence on Product Domains}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {119--130},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2449},
URN = {urn:nbn:de:0030-drops-24496},
doi = {10.4230/LIPIcs.STACS.2010.2449},
annote = {Keywords: Data Streams, Randomized Algorithms, Streaming Algorithms, Independence, Sketches}
}
@InProceedings{bravyi_et_al:LIPIcs.STACS.2010.2450,
author = {Bravyi, Sergey and Harrow, Aram W. and Hassidim, Avinatan},
title = {{Quantum Algorithms for Testing Properties of Distributions}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {131--142},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2450},
URN = {urn:nbn:de:0030-drops-24502},
doi = {10.4230/LIPIcs.STACS.2010.2450},
annote = {Keywords: Quantum computing, property testing, sampling}
}
@InProceedings{bshouty_et_al:LIPIcs.STACS.2010.2496,
author = {Bshouty, Nader H. and Mazzawi, Hanna},
title = {{Optimal Query Complexity for Reconstructing Hypergraphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {143--154},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2496},
URN = {urn:nbn:de:0030-drops-24968},
doi = {10.4230/LIPIcs.STACS.2010.2496},
annote = {Keywords: Query complexity, hypergraphs}
}
@InProceedings{cervelle_et_al:LIPIcs.STACS.2010.2451,
author = {Cervelle, Julien and Formenti, Enrico and Guillon, Pierre},
title = {{Ultimate Traces of Cellular Automata}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {155--166},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2451},
URN = {urn:nbn:de:0030-drops-24518},
doi = {10.4230/LIPIcs.STACS.2010.2451},
annote = {Keywords: Discrete dynamical systems, cellular automata, symbolic dynamics, sofic systems, formal languages, decidability}
}
@InProceedings{chakraborty_et_al:LIPIcs.STACS.2010.2452,
author = {Chakraborty, Sourav and Fischer, Eldar and Lachish, Oded and Yuster, Raphael},
title = {{Two-phase Algorithms for the Parametric Shortest Path Problem}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {167--178},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2452},
URN = {urn:nbn:de:0030-drops-24523},
doi = {10.4230/LIPIcs.STACS.2010.2452},
annote = {Keywords: Parametric Algorithms, Shortest path problem}
}
@InProceedings{chan_et_al:LIPIcs.STACS.2010.2453,
author = {Chan, Ho-Leung and Lam, Tak-Wah and Lee, Lap-Kei and Ting, Hing-Fung},
title = {{Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {179--190},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2453},
URN = {urn:nbn:de:0030-drops-24536},
doi = {10.4230/LIPIcs.STACS.2010.2453},
annote = {Keywords: Algorithms, distributed data streams, communication efficiency, frequent items}
}
@InProceedings{chechik_et_al:LIPIcs.STACS.2010.2454,
author = {Chechik, Shiri and Peleg, David},
title = {{Robust Fault Tolerant Uncapacitated Facility Location}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {191--202},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2454},
URN = {urn:nbn:de:0030-drops-24547},
doi = {10.4230/LIPIcs.STACS.2010.2454},
annote = {Keywords: Facility location, approximation algorithms, fault-tolerance}
}
@InProceedings{chen_et_al:LIPIcs.STACS.2010.2455,
author = {Chen, Victor and Grigorescu, Elena and de Wolf, Ronald},
title = {{Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {203--214},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2455},
URN = {urn:nbn:de:0030-drops-24558},
doi = {10.4230/LIPIcs.STACS.2010.2455},
annote = {Keywords: Data Structures, Error-Correcting Codes, Membership, Polynomial Evaluation}
}
@InProceedings{das_et_al:LIPIcs.STACS.2010.2456,
author = {Das, Bireswar and Datta, Samir and Nimbhorkar, Prajakta},
title = {{Log-space Algorithms for Paths and Matchings in k-trees}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {215--226},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2456},
URN = {urn:nbn:de:0030-drops-24563},
doi = {10.4230/LIPIcs.STACS.2010.2456},
annote = {Keywords: k-trees, reachability, matching, log-space}
}
@InProceedings{das_et_al:LIPIcs.STACS.2010.2457,
author = {Das, Bireswar and Tor\'{a}n, Jacobo and Wagner, Fabian},
title = {{Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {227--238},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2457},
URN = {urn:nbn:de:0030-drops-24570},
doi = {10.4230/LIPIcs.STACS.2010.2457},
annote = {Keywords: Complexity, Algorithms, Graph Isomorphism Problem, Treewidth, LogCFL}
}
@InProceedings{vannijnatten_et_al:LIPIcs.STACS.2010.2458,
author = {van Nijnatten, Fred and Sitters, Ren\'{e} and Woeginger, Gerhard J. and Wolff, Alexander and de Berg, Mark},
title = {{The Traveling Salesman Problem under Squared Euclidean Distances}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {239--250},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2458},
URN = {urn:nbn:de:0030-drops-24580},
doi = {10.4230/LIPIcs.STACS.2010.2458},
annote = {Keywords: Geometric traveling salesman problem, power-assignment in wireless networks, distance-power gradient, NP-hard, APX-hard}
}
@InProceedings{dorn_et_al:LIPIcs.STACS.2010.2459,
author = {Dorn, Frederic and Fomin, Fedor V. and Lokshtanov, Daniel and Raman, Venkatesh and Saurabh, Saket},
title = {{Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {251--262},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2459},
URN = {urn:nbn:de:0030-drops-24599},
doi = {10.4230/LIPIcs.STACS.2010.2459},
annote = {Keywords: Parameterized Subexponential Algorithms, Directed Graphs, Out-Branching, Internal Out-Branching}
}
@InProceedings{dorn:LIPIcs.STACS.2010.2460,
author = {Dorn, Frederic},
title = {{Planar Subgraph Isomorphism Revisited}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {263--274},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2460},
URN = {urn:nbn:de:0030-drops-24605},
doi = {10.4230/LIPIcs.STACS.2010.2460},
annote = {Keywords: Graph algorithms, Subgraph Isomorphism, NP-hard problems, Dynamic programming, Topological graph theory}
}
@InProceedings{doty_et_al:LIPIcs.STACS.2010.2461,
author = {Doty, David and Lutz, Jack H. and Patitz, Matthew J. and Summers, Scott M. and Woods, Damien},
title = {{Intrinsic Universality in Self-Assembly}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {275--286},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2461},
URN = {urn:nbn:de:0030-drops-24619},
doi = {10.4230/LIPIcs.STACS.2010.2461},
annote = {Keywords: Biological computing, Molecular computation, intrinsic universality, self-assembly}
}
@InProceedings{dutting_et_al:LIPIcs.STACS.2010.2463,
author = {D\"{u}tting, Paul and Henzinger, Monika and Weber, Ingmar},
title = {{Sponsored Search, Market Equilibria, and the Hungarian Method}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {287--298},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2463},
URN = {urn:nbn:de:0030-drops-24636},
doi = {10.4230/LIPIcs.STACS.2010.2463},
annote = {Keywords: Stable matching, truthful matching mechanism, general position}
}
@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2010.2464,
author = {Dumitrescu, Adrian and Jiang, Minghui},
title = {{Dispersion in Unit Disks}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {299--310},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2464},
URN = {urn:nbn:de:0030-drops-24646},
doi = {10.4230/LIPIcs.STACS.2010.2464},
annote = {Keywords: Dispersion problem, linear programming, approximation algorithm}
}
@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2010.2465,
author = {Dumitrescu, Adrian and T\'{o}th, Csaba D.},
title = {{Long Non-crossing Configurations in the Plane}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {311--322},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2465},
URN = {urn:nbn:de:0030-drops-24655},
doi = {10.4230/LIPIcs.STACS.2010.2465},
annote = {Keywords: Longest non-crossing Hamiltonian path, longest non-crossing Hamiltonian cycle, longest non-crossing spanning tree, approximation algorithm.}
}
@InProceedings{dyer_et_al:LIPIcs.STACS.2010.2466,
author = {Dyer, Martin and Goldberg, Leslie Ann and Jalsenius, Markus and Richerby, David},
title = {{The Complexity of Approximating Bounded-Degree Boolean #CSP}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {323--334},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2466},
URN = {urn:nbn:de:0030-drops-24669},
doi = {10.4230/LIPIcs.STACS.2010.2466},
annote = {Keywords: Boolean constraint satisfaction problem, generalized satisfiability, counting, approximation algorithms}
}
@InProceedings{egri_et_al:LIPIcs.STACS.2010.2467,
author = {Egri, L\'{a}szl\'{o} and Krokhin, Andrei and Larose, Benoit and Tesson, Pascal},
title = {{The Complexity of the List Homomorphism Problem for Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {335--346},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2467},
URN = {urn:nbn:de:0030-drops-24675},
doi = {10.4230/LIPIcs.STACS.2010.2467},
annote = {Keywords: Graph homomorphism, constraint satisfaction problem, complexity, universal algebra, Datalog}
}
@InProceedings{epstein_et_al:LIPIcs.STACS.2010.2476,
author = {Epstein, Leah and Levin, Asaf and Mestre, Juli\'{a}n and Segev, Danny},
title = {{Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {347--358},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2476},
URN = {urn:nbn:de:0030-drops-24766},
doi = {10.4230/LIPIcs.STACS.2010.2476},
annote = {Keywords: Approximation guarantees, semi-streaming model, one-pass algorithm}
}
@InProceedings{esparza_et_al:LIPIcs.STACS.2010.2468,
author = {Esparza, Javier and Gaiser, Andreas and Kiefer, Stefan},
title = {{Computing Least Fixed Points of Probabilistic Systems of Polynomials}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {359--370},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2468},
URN = {urn:nbn:de:0030-drops-24685},
doi = {10.4230/LIPIcs.STACS.2010.2468},
annote = {Keywords: Computing fixed points, numerical approximation, stochastic models, branching processes}
}
@InProceedings{fiala_et_al:LIPIcs.STACS.2010.2469,
author = {Fiala, Jiri and Kaminski, Marcin and Lidick\'{y}, Bernard and Paulusma, Dani\"{e}l},
title = {{The k-in-a-path Problem for Claw-free Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {371--382},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2469},
URN = {urn:nbn:de:0030-drops-24692},
doi = {10.4230/LIPIcs.STACS.2010.2469},
annote = {Keywords: Induced path, claw-free graph, polynomial-time algorithm}
}
@InProceedings{fomin_et_al:LIPIcs.STACS.2010.2470,
author = {Fomin, Fedor V. and Villanger, Yngve},
title = {{Finding Induced Subgraphs via Minimal Triangulations}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {383--394},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2470},
URN = {urn:nbn:de:0030-drops-24708},
doi = {10.4230/LIPIcs.STACS.2010.2470},
annote = {Keywords: Bounded treewidth, minimal triangulation, moderately exponential time algorithms}
}
@InProceedings{fortnow_et_al:LIPIcs.STACS.2010.2471,
author = {Fortnow, Lance and Lutz, Jack H. and Mayordomo, Elvira},
title = {{Inseparability and Strong Hypotheses for Disjoint NP Pairs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {395--404},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2471},
URN = {urn:nbn:de:0030-drops-24711},
doi = {10.4230/LIPIcs.STACS.2010.2471},
annote = {Keywords: Computational Complexity, Disjoint NP-pairs, Resource-Bounded Measure, Genericity}
}
@InProceedings{goller_et_al:LIPIcs.STACS.2010.2472,
author = {G\"{o}ller, Stefan and Lohrey, Markus},
title = {{Branching-time Model Checking of One-counter Processes}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {405--416},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2472},
URN = {urn:nbn:de:0030-drops-24722},
doi = {10.4230/LIPIcs.STACS.2010.2472},
annote = {Keywords: Model checking, computation tree logic, complexity theory}
}
@InProceedings{grigorieff_et_al:LIPIcs.STACS.2010.2473,
author = {Grigorieff, Serge and Valarcher, Pierre},
title = {{Evolving Multialgebras Unify All Usual Sequential Computation Models}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {417--428},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2473},
URN = {urn:nbn:de:0030-drops-24737},
doi = {10.4230/LIPIcs.STACS.2010.2473},
annote = {Keywords: Abstract state machines, Models of machines, Computability, Universality, Logic in computer science, Theory of algorithms}
}
@InProceedings{gu_et_al:LIPIcs.STACS.2010.2462,
author = {Gu, Xiaoyang and Hitchcock, John M. and Pavan, Aduri},
title = {{Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {429--440},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2462},
URN = {urn:nbn:de:0030-drops-24627},
doi = {10.4230/LIPIcs.STACS.2010.2462},
annote = {Keywords: Computational complexity, NP-completeness}
}
@InProceedings{guillon_et_al:LIPIcs.STACS.2010.2474,
author = {Guillon, Pierre and Richard, Ga\'{e}tan},
title = {{Revisiting the Rice Theorem of Cellular Automata}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {441--452},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2474},
URN = {urn:nbn:de:0030-drops-24744},
doi = {10.4230/LIPIcs.STACS.2010.2474},
annote = {Keywords: Cellular automata, undecidability}
}
@InProceedings{hirsch_et_al:LIPIcs.STACS.2010.2475,
author = {Hirsch, Edward A. and Itsykson, Dmitry},
title = {{On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {453--464},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2475},
URN = {urn:nbn:de:0030-drops-24753},
doi = {10.4230/LIPIcs.STACS.2010.2475},
annote = {Keywords: Propositional proof complexity, optimal algorithm}
}
@InProceedings{jansen:LIPIcs.STACS.2010.2477,
author = {Jansen, Maurice},
title = {{Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {465--476},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2477},
URN = {urn:nbn:de:0030-drops-24770},
doi = {10.4230/LIPIcs.STACS.2010.2477},
annote = {Keywords: Computational complexity, arithmetic circuits, hardness-randomness tradeoffs, identity testing, determinant versus permanent}
}
@InProceedings{jez_et_al:LIPIcs.STACS.2010.2478,
author = {Jez, Artur and Okhotin, Alexander},
title = {{On Equations over Sets of Integers}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {477--488},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2478},
URN = {urn:nbn:de:0030-drops-24780},
doi = {10.4230/LIPIcs.STACS.2010.2478},
annote = {Keywords: Language equations, computability, arithmetical hierarchy, hyper-arithmetical hierarchy}
}
@InProceedings{jez:LIPIcs.STACS.2010.2479,
author = {Jez, Lukasz},
title = {{Randomized Algorithm for Agreeable Deadlines Packet Scheduling}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {489--500},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2479},
URN = {urn:nbn:de:0030-drops-24795},
doi = {10.4230/LIPIcs.STACS.2010.2479},
annote = {Keywords: Online algorithms, scheduling, buffer management}
}
@InProceedings{kartzow:LIPIcs.STACS.2010.2480,
author = {Kartzow, Alexander},
title = {{Collapsible Pushdown Graphs of Level 2 are Tree-Automatic}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {501--512},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2480},
URN = {urn:nbn:de:0030-drops-24801},
doi = {10.4230/LIPIcs.STACS.2010.2480},
annote = {Keywords: Tree-automatic structures, collapsible pushdown graphs, collapsible pushdown systems, first-order decidability, reachability}
}
@InProceedings{khanna_et_al:LIPIcs.STACS.2010.2481,
author = {Khanna, Neelesh and Baswana, Surender},
title = {{Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {513--524},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2481},
URN = {urn:nbn:de:0030-drops-24812},
doi = {10.4230/LIPIcs.STACS.2010.2481},
annote = {Keywords: Shortest path, distance, distance queries, oracle}
}
@InProceedings{kowalczyk_et_al:LIPIcs.STACS.2010.2482,
author = {Kowalczyk, Michael and Cai, Jin-Yi},
title = {{Holant Problems for Regular Graphs with Complex Edge Functions}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {525--536},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2482},
URN = {urn:nbn:de:0030-drops-24826},
doi = {10.4230/LIPIcs.STACS.2010.2482},
annote = {Keywords: Computational complexity}
}
@InProceedings{kuske:LIPIcs.STACS.2010.2483,
author = {Kuske, Dietrich},
title = {{Is Ramsey's Theorem omega-automatic?}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {537--548},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2483},
URN = {urn:nbn:de:0030-drops-24838},
doi = {10.4230/LIPIcs.STACS.2010.2483},
annote = {Keywords: Logic in computer science, automata, Ramsey theory}
}
@InProceedings{legall:LIPIcs.STACS.2010.2484,
author = {Le Gall, Fran\c{c}ois},
title = {{An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {549--560},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2484},
URN = {urn:nbn:de:0030-drops-24843},
doi = {10.4230/LIPIcs.STACS.2010.2484},
annote = {Keywords: Quantum algorithms, group isomorphism problem, black-box groups}
}
@InProceedings{marx_et_al:LIPIcs.STACS.2010.2485,
author = {Marx, D\'{a}niel and O'Sullivan, Barry and Razgon, Igor},
title = {{Treewidth Reduction for Constrained Separation and Bipartization Problems}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {561--572},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2485},
URN = {urn:nbn:de:0030-drops-24850},
doi = {10.4230/LIPIcs.STACS.2010.2485},
annote = {Keywords: Fixed-parameter algorithms, graph separation problems, treewidth}
}
@InProceedings{mathieu_et_al:LIPIcs.STACS.2010.2486,
author = {Mathieu, Claire and Sankur, Ocan and Schudy, Warren},
title = {{Online Correlation Clustering}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {573--584},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2486},
URN = {urn:nbn:de:0030-drops-24862},
doi = {10.4230/LIPIcs.STACS.2010.2486},
annote = {Keywords: Correlation clustering, online algorithms}
}
@InProceedings{mertzios_et_al:LIPIcs.STACS.2010.2487,
author = {Mertzios, George B. and Sau, Ignasi and Zaks, Shmuel},
title = {{The Recognition of Tolerance and Bounded Tolerance Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {585--596},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2487},
URN = {urn:nbn:de:0030-drops-24876},
doi = {10.4230/LIPIcs.STACS.2010.2487},
annote = {Keywords: Tolerance graphs, bounded tolerance graphs, recognition, vertex splitting, NP-complete, trapezoid graphs, permutation graphs}
}
@InProceedings{montanari_et_al:LIPIcs.STACS.2010.2488,
author = {Montanari, Angelo and Puppis, Gabriele and Sala, Pietro and Sciavicco, Guido},
title = {{Decidability of the Interval Temporal Logic ABB over the Natural Numbers}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {597--608},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2488},
URN = {urn:nbn:de:0030-drops-24884},
doi = {10.4230/LIPIcs.STACS.2010.2488},
annote = {Keywords: Interval temporal logics, compass structures, decidability, complexity}
}
@InProceedings{peleg_et_al:LIPIcs.STACS.2010.2489,
author = {Peleg, David and Roditty, Liam},
title = {{Relaxed Spanners for Directed Disk Graphs}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {609--620},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2489},
URN = {urn:nbn:de:0030-drops-24898},
doi = {10.4230/LIPIcs.STACS.2010.2489},
annote = {Keywords: Spanners, directed graphs}
}
@InProceedings{scheder:LIPIcs.STACS.2010.2490,
author = {Scheder, Dominik},
title = {{Unsatisfiable Linear CNF Formulas Are Large and Complex}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {621--632},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2490},
URN = {urn:nbn:de:0030-drops-24901},
doi = {10.4230/LIPIcs.STACS.2010.2490},
annote = {Keywords: Extremal combinatorics, proof complexity, probabilistic method}
}
@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.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}
}
@InProceedings{schroder_et_al:LIPIcs.STACS.2010.2492,
author = {Schr\"{o}der, Lutz and Pattinson, Dirk},
title = {{Named Models in Coalgebraic Hybrid Logic}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {645--656},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2492},
URN = {urn:nbn:de:0030-drops-24920},
doi = {10.4230/LIPIcs.STACS.2010.2492},
annote = {Keywords: Logic in computer science, semantics, deduction, modal logic, coalgebra}
}
@InProceedings{takhanov:LIPIcs.STACS.2010.2493,
author = {Takhanov, Rustem},
title = {{A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {657--668},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2493},
URN = {urn:nbn:de:0030-drops-24936},
doi = {10.4230/LIPIcs.STACS.2010.2493},
annote = {Keywords: Minimum cost homomorphisms problem, relational clones, constraint satisfaction problem, perfect graphs, supervised learning}
}
@InProceedings{williams:LIPIcs.STACS.2010.2494,
author = {Williams, Ryan},
title = {{Alternation-Trading Proofs, Linear Programming, and Lower Bounds}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {669--680},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2494},
URN = {urn:nbn:de:0030-drops-24940},
doi = {10.4230/LIPIcs.STACS.2010.2494},
annote = {Keywords: Time-space tradeoffs, lower bounds, alternation, linear programming}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing