@incollection{Rabani/12,
AUTHOR = {Rabani, Yuval},
TITLE = {Learning mixtures of distributions over large discrete domains},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {1-3},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3842},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bojanczyk-Torunczyk/12,
AUTHOR = {Bojanczyk, Mikolaj and Torunczyk, Szymon},
TITLE = {Imperative programming in sets with atoms},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {4-15},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3843},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Achlioptas-Gouleakis/12,
AUTHOR = {Achlioptas, Dimitris and Gouleakis, Themis},
TITLE = {Algorithmic improvements of the Lov{\'a}sz local lemma via cluster expansion},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {16-23},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3844},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Godefroid/12,
AUTHOR = {Godefroid, Patrice},
TITLE = {Test generation using symbolic execution},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {24-33},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3845},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Parthasarathy/12,
AUTHOR = {Parthasarathy, Madhusudan},
TITLE = {Automated reasoning and natural proofs for programs manipulating data structures},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {34-35},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3889},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kopparty-Srinivasan/12,
AUTHOR = {Kopparty, Swastik and Srinivasan, Srikanth},
TITLE = {Certifying polynomials for $\mbox{AC}^0$(parity) circuits, with applications},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {36-47},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3846},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Vempala/12,
AUTHOR = {Vempala, Santosh S.},
TITLE = {Randomly-oriented $k-d$ trees adapt to intrinsic dimension},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {48-57},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3847},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Goyal-Rademacher/12,
AUTHOR = {Goyal, Navin and Rademacher, Luis},
TITLE = {Lower bounds for the average and smoothed number of Pareto optima},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {58-69},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3848},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Feigenblat-Porat-Shiftan/12,
AUTHOR = {Feigenblat, Guy and Porat, Ely and Shiftan, Ariel},
TITLE = {Exponential space improvement for minwise based algorithms},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {70-85},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3849},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Krebs-Straubing/12,
AUTHOR = {Krebs, Andreas and Straubing, Howard},
TITLE = {An effective characterization of the alternation hierarchy in two-variable logic},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {86-98},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3850},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Barany-Bojanczyk-Figueira-Parys/12,
AUTHOR = {B{\'a}r{\'a}ny, Vince and Bojanczyk, Mikolaj and Figueira, Diego and Parys, Pawel},
TITLE = {Decidable classes of documents for XPath},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {99-111},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3851},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Gajarsky-Hlineny/12,
AUTHOR = {Gajarsky, Jakub and Hlineny, Petr},
TITLE = {Faster deciding MSO properties of trees of fixed height, and some consequences},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {112-123},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3855},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fijalkow-Zimmermann/12,
AUTHOR = {Fijalkow, Nathanael and Zimmermann, Martin},
TITLE = {Cost-parity and cost-Streett games},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {124-135},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3853},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kothapalli-Pemmaraju/12,
AUTHOR = {Kothapalli, Kishore and Pemmaraju, Sriram},
TITLE = {Super-fast 3-ruling sets},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {136-147},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3854},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ivanyos-Klauck-Lee-Santha-de_Wolf/12,
AUTHOR = {Ivanyos, G{\'a}bor and Klauck, Hartmut and Lee, Troy and Santha, Miklos and de Wolf, Ronald},
TITLE = {New bounds on the classical and quantum communication complexity of some graph properties},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {148-159},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3852},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Broadbent-Goller/12,
AUTHOR = {Broadbent, Christopher and G{\"o}ller, Stefan},
TITLE = {On bisimilarity of higher-order pushdown automata: Undecidability at order two},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {160-172},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3858},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{La_Torre-Parlato/12,
AUTHOR = {La Torre, Salvatore and Parlato, Gennaro},
TITLE = {Scope-bounded multistack pushdown systems: Fixed-point, sequentialization, and tree-width},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {173-184},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3856},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Khandekar-Hildrum-Rajan-Wolf/12,
AUTHOR = {Khandekar, Rohit and Hildrum, Kirsten and Rajan, Deepak and Wolf, Joel},
TITLE = {Scheduling with setup costs and monotone penalties},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {185-198},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3857},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chakaravarthy-Pal-Roy-Sabharwal/12,
AUTHOR = {Chakaravarthy, Venkatesan T. and Pal, Arindam and Roy, Sambuddha and Sabharwal, Yogish},
TITLE = {Scheduling resources for executing a partial set of jobs},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {199-210},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3859},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bozzelli-Sanchez/12,
AUTHOR = {Bozzelli, Laura and S{\'a}nchez, C{\'e}sar},
TITLE = {Visibly rational expressions},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {211-223},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3860},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Heussner-Le_Gall-Sutre/12,
AUTHOR = {Heu{\ss}ner, Alexander and Le Gall, Tristan and Sutre, Gr{\'e}goire},
TITLE = {Safety verification of communicating one-counter machines},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {224-235},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3861},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chakaravarthy-Modani-Natarajan-Roy-Sabharwal/12,
AUTHOR = {Chakaravarthy, Venkatesan T. and Modani, Natwar and Natarajan, Sivaramakrishnan R. and Roy, Sambuddha and Sabharwal, Yogish},
TITLE = {Density functions subject to a co-matroid constraint},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {236-248},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3862},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kumar-Panda-Sarangi/12,
AUTHOR = {Kumar, Amit and Panda, Preeti R. and Sarangi, Smruti},
TITLE = {Efficient on-line algorithm for maintaining $k$-cover of sparse bit-strings},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {249-256},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3863},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Anand-Baswana-Gupta-Sen/12,
AUTHOR = {Anand, Abhash and Baswana, Surender and Gupta, Manoj and Sen, Sandeep},
TITLE = {Maintaining approximate maximum weighted matching in fully dynamic graphs},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {257-266},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3864},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Elbassioni-Garg-Gupta-Kumar-Narula-Pal/12,
AUTHOR = {Elbassioni, Khaled and Garg, Naveen and Gupta, Divya and Kumar, Amit and Narula, Vishal and Pal, Arindam},
TITLE = {Approximation algorithms for the unsplittable flow problem on paths and trees},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {267-275},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3865},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Danos-Feret-Fontana-Harmer-Hayman-Krivine-Thompson-Walsh-Winskel/12,
AUTHOR = {Danos, Vincent and Feret, Jerome and Fontana, Walter and Harmer, Russell and Hayman, Jonathan and Krivine, Jean and Thompson-Walsh, Chris and Winskel, Glynn},
TITLE = {Graphs, rewriting and pathway reconstruction for rule-based models},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {276-288},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3866},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Delzanno-Sangnier-Traverso-Zavattaro/12,
AUTHOR = {Delzanno, Giorgio and Sangnier, Arnaud and Traverso, Riccardo and Zavattaro, Gianluigi},
TITLE = {On the complexity of parameterized reachability in reconfigurable broadcast networks},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {289-300},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3867},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bonnet-Finkel-Praveen/12,
AUTHOR = {Bonnet, R{\'e}mi and Finkel, Alain and Praveen, M.},
TITLE = {Extending the Rackoff technique to Affine nets},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {301-312},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3868},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Lin/12,
AUTHOR = {Lin, Anthony Widjaja},
TITLE = {Accelerating tree-automatic relations},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {313-324},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3869},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bhattacharya-Hu/12,
AUTHOR = {Bhattacharya, Binay and Hu, Yuzhuang},
TITLE = {$k$-delivery Traveling Salesman Problem on tree networks},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {325-336},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3870},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bonsma/12,
AUTHOR = {Bonsma, Paul},
TITLE = {Rerouting shortest paths in planar graphs},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {337-349},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3871},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Rajan/12,
AUTHOR = {Rajan, Varun},
TITLE = {Space efficient edge-fault tolerant routing},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {350-361},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3872},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Boker-Henzinger/12,
AUTHOR = {Boker, Udi and Henzinger, Thomas A.},
TITLE = {Approximate determinization of quantitative automata},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {362-373},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3873},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Abdulla-Atig-Cederberg/12,
AUTHOR = {Abdulla, Parosh Aziz and Atig, Mohamed Faouzi and Cederberg, Jonathan},
TITLE = {Timed lossy channel systems},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {374-386},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3874},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kobler-Kuhnert-Verbitsky/12,
AUTHOR = {K{\"o}bler, Johannes and Kuhnert, Sebastian and Verbitsky, Oleg},
TITLE = {Solving the canonical representation and star system problems for proper circular-arc graphs in logspace},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {387-399},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3875},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Crowston-Gutin-Jones/12,
AUTHOR = {Crowston, Robert and Gutin, Gregory and Jones, Mark},
TITLE = {Directed acyclic subgraph problem parameterized above the Poljak-Turzik bound},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {400-411},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3876},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Mnich-Philip-Saurabh-Suchy/12,
AUTHOR = {Mnich, Matthias and Philip, Geevarghese and Saurabh, Saket and Suchy, Ondrej},
TITLE = {Beyond Max-Cut: Lambda-extendible properties parameterized above the Poljak-Turzik bound},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {412-423},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3877},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Lokshtanov-Saurabh-Wahlstrom/12,
AUTHOR = {Lokshtanov, Daniel and Saurabh, Saket and Wahlstr{\"o}m, Magnus},
TITLE = {Subexponential parameterized odd cycle transversal on planar graphs},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {424-434},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3878},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Hermanns-Turrini/12,
AUTHOR = {Hermanns, Holger and Turrini, Andrea},
TITLE = {Deciding probabilistic automata weak bisimulation in polynomial time},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {435-447},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3879},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Forejt-Jancar-Kiefer-Worrell/12,
AUTHOR = {Forejt, Vojtech and Jancar, Petr and Kiefer, Stefan and Worrell, James},
TITLE = {Bisimilarity of probabilistic pushdown automata},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {448-460},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3880},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chatterjee-Joglekar-Shah/12,
AUTHOR = {Chatterjee, Krishnendu and Joglekar, Manas and Shah, Nisarg},
TITLE = {Average case analysis of the classical algorithm for Markov decision processes with B{\"u}chi objectives},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {461-473},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3881},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Brazdil-Hermanns-Krcal-Kretinsky-Rehak/12,
AUTHOR = {Brazdil, Tomas and Hermanns, Holger and Krcal, Jan and Kretinsky, Jan and Rehak, Vojtech},
TITLE = {Verification of open interactive Markov chains},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {474-485},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3882},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Varadarajan-Xiao/12,
AUTHOR = {Varadarajan, Kasturi and Xiao, Xin},
TITLE = {On the sensitivity of shape fitting problems},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {486-497},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3883},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ahn-Cheng-Kweon-Yon/12,
AUTHOR = {Ahn, Hee-Kap and Cheng, Siu-Wing and Kweon, Hyuk Jun and Yon, Juyoung},
TITLE = {Overlap of convex polytopes under rigid motion},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {498-509},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3884},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{De-Nandy-Roy/12,
AUTHOR = {De, Minati and Nandy, Subhas C. and Roy, Sasanka},
TITLE = {Minimum enclosing circle with few extra variables},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {510-521},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3885},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Devaki-Kanade/12,
AUTHOR = {Devaki, Pranavadatta and Kanade, Aditya},
TITLE = {Static analysis for checking data format compatibility of programs},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {522-533},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3886},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chadha-Ummels/12,
AUTHOR = {Chadha, Rohit and Ummels, Michael},
TITLE = {The complexity of quantitative information flow in recursive programs},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {534-545},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3887},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bana-Adao-Sakurada/12,
AUTHOR = {Bana, Gergei and Adao, Pedro and Sakurada, Hideki},
TITLE = {Computationally complete symbolic attacker in action},
BOOKTITLE = {Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {18},
PAGES = {546-560},
YEAR = {2012},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhadrishnan, Jaikumar},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3888},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Colcombet/12,
AUTHOR = {Colcombet, Thomas},
TITLE = {Forms of determinism for automata},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {1-23},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3386},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ravi/12,
AUTHOR = {Ravi, R.},
TITLE = {Iterative methods in combinatorial optimization},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {24-24},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3387},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Dietzfelbinger/12,
AUTHOR = {Dietzfelbinger, Martin},
TITLE = {On randomness in hash functions},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {25-28},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3388},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Goldwasser/12,
AUTHOR = {Goldwasser, Shafi},
TITLE = {Pseudo-deterministic algorithms},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {29-29},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3443},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Mucha/12,
AUTHOR = {Mucha, Marcin},
TITLE = {$\frac{13}{9}$-approximation for graphic TSP},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {30-41},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3402},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ward/12,
AUTHOR = {Ward, Justin},
TITLE = {A $(k+3)/2$-approximation algorithm for monotone submodular $k$-set packing and general $k$-exchange systems},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {42-53},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3431},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Parys/12,
AUTHOR = {Parys, Pawe{\l}},
TITLE = {A pumping lemma for pushdown graphs of any level},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {54-65},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3394},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Elberfeld-Jakoby-Tantau/12,
AUTHOR = {Elberfeld, Michael and Jakoby, Andreas and Tantau, Till},
TITLE = {Algorithmic meta theorems for circuit classes of constant and logarithmic depth},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {66-77},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3405},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Thurley/12,
AUTHOR = {Thurley, Marc},
TITLE = {An approximation algorithm for \#$k$-SAT},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {78-87},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3440},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bassino-David-Sportiello/12,
AUTHOR = {Bassino, Fr{\'e}d{\'e}rique and David, Julien and Sportiello, Andrea},
TITLE = {Asymptotic enumeration of minimal automata},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {88-99},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3432},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Feldmann-Foschini/12,
AUTHOR = {Feldmann, Andreas Emil and Foschini, Luca},
TITLE = {Balanced partitions of trees and applications},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {100-111},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3408},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Brodal-Kejlberg-Rasmussen/12,
AUTHOR = {Brodal, Gerth St{\o}lting and Kejlberg-Rasmussen, Casper},
TITLE = {Cache-oblivious implicit predecessor dictionaries with the working-set property},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {112-123},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3410},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chung-Lam-Liu-Mitzenmacher/12,
AUTHOR = {Chung, Kai-Min and Lam, Henry and Liu, Zhenming and Mitzenmacher, Michael},
TITLE = {Chernoff-Hoeffding bounds for Markov chains: Generalized and simplified},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {124-135},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3437},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Jez/12a,
AUTHOR = {Je{\.z}, Artur},
TITLE = {Compressed membership for NFA (DFA) with compressed labels is in NP (P)},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {136-147},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3406},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Goller-Lin/12,
AUTHOR = {G{\"o}ller, Stefan and Lin, Anthony Widjaja},
TITLE = {Concurrency makes simple theories hard},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {148-159},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3421},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bartschi-Suri/12,
AUTHOR = {B{\"a}rtschi, Andreas and Suri, Subhash},
TITLE = {Conflict-free chromatic art gallery coverage},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {160-171},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3395},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Merkle-Teutsch/12,
AUTHOR = {Merkle, Wolfgang and Teutsch, Jason},
TITLE = {Constant compression and random weights},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {172-181},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3435},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kaminski-Thilikos/12,
AUTHOR = {Kami{\'n}ski, Marcin and Thilikos, Dimitrios M.},
TITLE = {Contraction checking in graphs on surfaces},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {182-193},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3403},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Carayol-Nicaud/12,
AUTHOR = {Carayol, Arnaud and Nicaud, Cyril},
TITLE = {Distribution of the number of accessible states in a random deterministic automaton},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {194-205},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3442},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kawarabayashi-Kobayashi/12c,
AUTHOR = {Kawarabayashi, Ken-ichi and Kobayashi, Yusuke},
TITLE = {Edge-disjoint odd cycles in 4-edge-connected graphs},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {206-217},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3417},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Diekert-Laun-Ushakov/12,
AUTHOR = {Diekert, Volker and Laun, J{\"u}rn and Ushakov, Alexander},
TITLE = {Efficient algorithms for highly compressed data: The word problem in Higman's group is in P},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {218-229},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3420},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ngo-Porat-Rudra/12,
AUTHOR = {Ngo, Hung Q. and Porat, Ely and Rudra, Atri},
TITLE = {Efficiently decodable compressed sensing by list-recoverable codes and recursion},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {230-241},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3401},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Durand-Gasselin-Habermehl/12,
AUTHOR = {Durand-Gasselin, Antoine and Habermehl, Peter},
TITLE = {Ehrenfeucht-Fra{\"{i}}ss{\'{e}} goes elementarily automatic for structures of bounded degree},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {242-253},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3419},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Datta-Gopalan-Kulkarni-Tewari/12,
AUTHOR = {Datta, Samir and Gopalan, Arjun and Kulkarni, Raghav and Tewari, Raghunath},
TITLE = {Improved bounds for bipartite matching on surfaces},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {254-265},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3414},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Koutis-Levin-Peng/12,
AUTHOR = {Koutis, Ioannis and Levin, Alex and Peng, Richard},
TITLE = {Improved spectral sparsification and numerical algorithms for SDD matrices},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {266-277},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3434},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kawarabayashi-Kobayashi/12b,
AUTHOR = {Kawarabayashi, Ken-ichi and Kobayashi, Yusuke},
TITLE = {Linear min-max relation between the treewidth of $H$-minor-free graphs and its largest grid minor},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {278-289},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3416},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chan-Durocher-Larsen-Morrison-Wilkinson/12,
AUTHOR = {Chan, Timothy M. and Durocher, Stephane and Larsen, Kasper Green and Morrison, Jason and Wilkinson, Bryan T.},
TITLE = {Linear-space data structures for range mode query in arrays},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {290-301},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3425},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bulatov-Dyer-Goldberg-Jerrum/12,
AUTHOR = {Bulatov, Andrei A. and Dyer, Martin and Goldberg, Leslie Ann and Jerrum, Mark},
TITLE = {Log-supermodular functions, functional clones and counting CSPs},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {302-313},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3407},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Giakkoupis-Sauerwald-Sun-Woelfel/12,
AUTHOR = {Giakkoupis, George and Sauerwald, Thomas and Sun, He and Woelfel, Philipp},
TITLE = {Low randomness rumor spreading via hashing},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {314-325},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3441},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ganian-Hlineny-Langer-Obdrzalek-Rossmanith/12,
AUTHOR = {Ganian, Robert and Hlin{\v{e}}n{\'y}, Petr and Langer, Alexander and Obdr{\v{z}}{\'a}lek, Jan and Rossmanith, Peter},
TITLE = {Lower bounds on the complexity of MSO$_1$ model-checking},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {326-337},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3418},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Narayanaswamy-Raman-Ramanujan-Saurabh/12,
AUTHOR = {Narayanaswamy, N.S. and Raman, Venkatesh and Ramanujan, M.S. and Saurabh, Saket},
TITLE = {LP can be a cure for parameterized problems},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {338-349},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3429},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Jain-Kinber/12,
AUTHOR = {Jain, Sanjay and Kinber, Efim},
TITLE = {Mind change speed-up for learning languages from positive data},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {350-361},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3393},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fournier-Malod-Mengel/12,
AUTHOR = {Fournier, Herv{\'e} and Malod, Guillaume and Mengel, Stefan},
TITLE = {Monomials in arithmetic circuits: Complete problems in the counting hierarchy},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {362-373},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3424},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Eggermont-Woeginger/12,
AUTHOR = {Eggermont, Christian E.J. and Woeginger, Gerhard J.},
TITLE = {Motion planning with pulley, rope, and baskets},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {374-383},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3390},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chen/12b,
AUTHOR = {Chen, Ning},
TITLE = {On computing pareto stable assignments},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {384-395},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3404},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Arnold-Michalewski-Niwinski/12,
AUTHOR = {Arnold, Andr{\'e} and Michalewski, Henryk and Niwi{\'n}ski, Damian},
TITLE = {On the separation question for tree languages},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {396-407},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3415},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Mitsche-Perarnau/12,
AUTHOR = {Mitsche, Dieter and Perarnau, Guillem},
TITLE = {On the treewidth and related parameters of random geometric graphs},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {408-419},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3428},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Witt/12,
AUTHOR = {Witt, Carsten},
TITLE = {Optimizing linear functions with randomized search heuristics --- The robustness of mutation},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {420-431},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3392},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fomin-Golovach/12,
AUTHOR = {Fomin, Fedor V. and Golovach, Petr A.},
TITLE = {Parameterized complexity of connected even/odd subgraph problems},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {432-440},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3398},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Doerr-Winzen/12a,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
TITLE = {Playing Mastermind with constant-size memory},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {441-452},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3411},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Babai-Qiao/12,
AUTHOR = {Babai, L{\'a}szl{\'o} and Qiao, Youming},
TITLE = {Polynomial-time isomorphism test for groups with Abelian Sylow towers},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {453-464},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3400},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Im-Sviridenko-van_der_Zwaan/12,
AUTHOR = {Im, Sungjin and Sviridenko, Maxim and van der Zwaan, Ruben},
TITLE = {Preemptive and non-preemptive generalized min sum set cover},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {465-476},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3399},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Sun-Wang/12a,
AUTHOR = {Sun, Xiaoming and Wang, Chengu},
TITLE = {Randomized communication complexity for linear algebra problems over finite fields},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {477-488},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3438},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Harwath-Schweikardt/12,
AUTHOR = {Harwath, Frederik and Schweikardt, Nicole},
TITLE = {Regular tree languages, cardinality predicates, and addition-invariant FO},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {489-500},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3439},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Paluch-Elbassioni-van_Zuylen/12,
AUTHOR = {Paluch, Katarzyna and Elbassioni, Khaled and van Zuylen, Anke},
TITLE = {Simpler approximation of the maximum asymmetric Traveling Salesman Problem},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {501-506},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3412},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Brazdil-Kiefer/12,
AUTHOR = {Br{\'a}zdil, Tom{\'a}{\v{s}} and Kiefer, Stefan},
TITLE = {Stabilization of branching queueing networks},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {507-518},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3413},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Jansen-Santhanam/12,
AUTHOR = {Jansen, Maurice and Santhanam, Rahul},
TITLE = {Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {519-530},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3430},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bonsma/12b,
AUTHOR = {Bonsma, Paul},
TITLE = {Surface split decompositions and subgraph isomorphism in graphs on surfaces},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {531-542},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3422},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bienvenu-Holzl-Miller-Nies/12,
AUTHOR = {Bienvenu, Laurent and H{\"o}lzl, Rupert and Miller, Joseph S. and Nies, Andr{\'e}},
TITLE = {The Denjoy alternative for computable functions},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {543-554},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3409},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Finkel/12a,
AUTHOR = {Finkel, Olivier},
TITLE = {The determinacy of context-free games},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {555-566},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3389},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Hoyrup/12,
AUTHOR = {Hoyrup, Mathieu},
TITLE = {The dimension of ergodic random sequences},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {567-576},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3391},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Zaid-Gradel-Kaiser/12,
AUTHOR = {Zaid, Faried Abu and Gr{\"a}del, Erich and Kaiser, Lukasz},
TITLE = {The field of reals is not $\omega$-automatic},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {577-588},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3423},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Broadbent/12a,
AUTHOR = {Broadbent, Christopher H.},
TITLE = {The limits of decidability for first order logic on CPDA graphs},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {589-600},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3433},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Filmus-Ward/12,
AUTHOR = {Filmus, Yuval and Ward, Justin},
TITLE = {The power of local search: Maximum coverage over a matroid},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {601-612},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3396},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kimura-Makino/12,
AUTHOR = {Kimura, Kei and Makino, Kazuhisa},
TITLE = {Trichotomy for integer linear systems based on their sign patterns},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {613-623},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3436},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Gawrychowski/12a,
AUTHOR = {Gawrychowski, Pawe{\l}},
TITLE = {Tying up the loose ends in fully LZW-compressed pattern matching},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {624-635},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3397},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ambainis/12,
AUTHOR = {Ambainis, Andris},
TITLE = {Variable time amplitude amplification and quantum algorithms for linear algebra problems},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {636-647},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3426},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bojanczyk-Torunczyk/12a,
AUTHOR = {Boja{\'n}czyk, Miko{\l}aj and Toru{\'n}czyk, Szymon},
TITLE = {Weak MSO+U over infinite trees},
BOOKTITLE = {Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS'2012 (Paris, France, February 29 - March 3, 2012)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {14},
PAGES = {648-660},
YEAR = {2012},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3427},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}