@incollection{Guruswami/13,
AUTHOR = {Guruswami, Venkatesan},
TITLE = {Polar codes: Reliable communication with complexity polynomial in the gap to Shannon capacity},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {1-1},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4399},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Hofmann-Ramyaa/13,
AUTHOR = {Hofmann, Martin and Ramyaa, Ramyaa},
TITLE = {Computing with a fixed number of pointers},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {3-18},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4400},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Khot/13,
AUTHOR = {Khot, Subhash},
TITLE = {On approximation resistance of predicates},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {19-19},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4401},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Grohe-Kreutzer-Siebertz/13,
AUTHOR = {Grohe, Martin and Kreutzer, Stephan and Siebertz, Sebastian},
TITLE = {Characterisations of nowhere dense graphs},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {21-40},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4402},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Terui/13,
AUTHOR = {Terui, Kazushige},
TITLE = {Intersection types for normalization and verification},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {41-42},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4403},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Crowston-Jones-Muciaccia-Philip-Rai-Saurabh/13,
AUTHOR = {Crowston, Robert and Jones, Mark and Muciaccia, Gabriele and Philip, Geevarghese and Rai, Ashutosh and Saurabh, Saket},
TITLE = {Polynomial kernels for $\lambda$-extendible properties parameterized above the Poljak-Turz{\'{i}}ik bound},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {43-54},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4359},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fernau-Schmid-Villanger/13,
AUTHOR = {Fernau, Henning and Schmid, Markus L. and Villanger, Yngve},
TITLE = {On the parameterised complexity of string morphism problems},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {55-66},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4361},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Basavaraju-Francis-Ramanujan-Saurabh/13,
AUTHOR = {Basavaraju, Manu and Francis, Mathew C. and Ramanujan, M.S. and Saurabh, Saket},
TITLE = {Partially polynomial kernels for {\sc Set Cover} and {\sc Test Cover}},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {67-78},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4362},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chitnis-Fomin-Golovach/13,
AUTHOR = {Chitnis, Rajesh and Fomin, Fedor V. and Golovach, Petr A.},
TITLE = {Parameterized complexity of the anchored $k$-core problem for directed graphs},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {79-90},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4363},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Clairambault-Murawski/13,
AUTHOR = {Clairambault, Pierre and Murawski, Andrzej S.},
TITLE = {B{\"o}hm trees as higher-order recursive schemes},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {91-102},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4364},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Salvati-Walukiewicz/13,
AUTHOR = {Salvati, Sylvain and Walukiewicz, Igor},
TITLE = {Evaluation is MSOL-compatible},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {103-114},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4365},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Haddad/13,
AUTHOR = {Haddad, Axel},
TITLE = {Model checking and functional program transformations},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {115-126},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4360},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Calin-Derevenetc-Majumdar-Meyer/13,
AUTHOR = {Calin, Georgel and Derevenetc, Egor and Majumdar, Rupak and Meyer, Roland},
TITLE = {A theory of partitioned global address spaces},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {127-139},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4366},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Harsha-Jain/13,
AUTHOR = {Harsha, Prahladh and Jain, Rahul},
TITLE = {A strong direct product theorem for the tribes function via the smooth-rectangle bound},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {141-152},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4367},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chandran-Rajendraprasad/13,
AUTHOR = {Chandran, L. Sunil and Rajendraprasad, Deepak},
TITLE = {Inapproximability of rainbow colouring},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {153-162},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4368},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Baskar-Naldurg-Raghavendra-Suresh/13,
AUTHOR = {Baskar, Anguraj and Naldurg, Prasad and Raghavendra, K.R. and Suresh, S.P.},
TITLE = {Primal Infon Logic: Derivability in polynomial time},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {163-174},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4370},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Potapov/13,
AUTHOR = {Potapov, Igor},
TITLE = {Composition problems for braids},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {175-187},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4371},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Krebs-Limaye/13,
AUTHOR = {Krebs, Andreas and Limaye, Nutan},
TITLE = {DLOGTIME proof systems},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {189-200},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4372},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Srinivasan/13,
AUTHOR = {Srinivasan, Srikanth},
TITLE = {On improved degree lower bounds for polynomial approximation},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {201-212},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4373},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Akshay-Dinca-Genest-Stefanescu/13,
AUTHOR = {Akshay, S. and Dinca, Ionut and Genest, Blaise and Stefanescu, Alin},
TITLE = {Implementing realistic asynchronous automata},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {213-224},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4374},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Esparza-Jezequel-Schwoon/13,
AUTHOR = {Esparza, Javier and Jezequel, Lo{\"{i}}g and Schwoon, Stefan},
TITLE = {Computation of summaries using net unfoldings},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {225-236},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4375},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Goyal-Misra-Panolan/13,
AUTHOR = {Goyal, Prachi and Misra, Neeldhara and Panolan, Fahad},
TITLE = {Faster deterministic algorithms for $r$-dimensional matching using representative sets},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {237-248},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4376},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Agarwal-Chakaravarthy-Choudhury-Roy-Sabharwal/13,
AUTHOR = {Agarwal, Archita and Chakaravarthy, Venkatesan T. and Choudhury, Anamitra R. and Roy, Sambuddha and Sabharwal, Yogish},
TITLE = {Distributed and parallel algorithms for set cover problems with small neighborhood covers},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {249-261},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4377},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Arora-Chakaravarthy-Gupta-Mukherjee-Sabharwal/13,
AUTHOR = {Arora, Sonika and Chakaravarthy, Venkatesan T. and Gupta, Neelima and Mukherjee, Koyel and Sabharwal, Yogish},
TITLE = {Replica placement via capacitated vertex cover},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {263-274},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4378},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chakaravarthy-Choudhury-Natarajan-Roy/13,
AUTHOR = {Chakaravarthy, Venkatesan T. and Choudhury, Anamitra Roy and Natarajan, Sivaramakrishnan R. and Roy, Sambuddha},
TITLE = {Knapsack cover subject to a matroid constraint},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {275-286},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4379},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Maubert-Pinchinat/13,
AUTHOR = {Maubert, Bastien and Pinchinat, Sophie},
TITLE = {Jumping automata for uniform strategies},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {287-298},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4380},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fijalkow-Pinchinat-Serre/13,
AUTHOR = {Fijalkow, Nathana{\"e}l and Pinchinat, Sophie and Serre, Olivier},
TITLE = {Emptiness of alternating tree automata using games with imperfect information},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {299-311},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4381},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Hague/13,
AUTHOR = {Hague, Matthew},
TITLE = {Saturation of concurrent collapsible pushdown systems},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {313-325},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4382},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Loding-Repke/13,
AUTHOR = {L{\"o}ding, Christof and Repke, Stefan},
TITLE = {Decidability results on the existence of lookahead delegators for NFA},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {327-338},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4383},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Huang-Kavitha-Mehlhorn-Michail/13,
AUTHOR = {Huang, Chien-Chung and Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios},
TITLE = {Fair matchings and related problems},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {339-350},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4384},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Li-Zhang/13,
AUTHOR = {Li, Jian and Zhang, Zeyu},
TITLE = {Ranking with diverse intents and correlated contents},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {351-362},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4385},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Place-van_Rooijen-Zeitoun/13,
AUTHOR = {Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc},
TITLE = {Separating regular languages by locally testable and locally threshold testable languages},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {363-375},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4386},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Holzer-Schallhart-Tautschnig-Veith/13,
AUTHOR = {Holzer, Andreas and Schallhart, Christian and Tautschnig, Michael and Veith, Helmut},
TITLE = {On the structure and complexity of rational sets of regular languages},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {377-388},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4387},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Consuegra-Narasimhan/13,
AUTHOR = {Consuegra, Mario E. and Narasimhan, Giri},
TITLE = {Geometric Avatar problems},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {389-400},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4388},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chalermsook-Venkatasubramanian/13,
AUTHOR = {Chalermsook, Parinya and Venkatasubramanian, Suresh},
TITLE = {Clustering with center constraints},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {401-412},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4389},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Smith/13,
AUTHOR = {Smith, Tim},
TITLE = {On infinite words determined by stack automata},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {413-424},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4369},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bodini-Genitrini-Peschanski/13,
AUTHOR = {Bodini, Olivier and Genitrini, Antoine and Peschanski, Fr{\'e}d{\'e}ric},
TITLE = {The combinatorics of non-determinism},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {425-436},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4390},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Saha/13,
AUTHOR = {Saha, Barna},
TITLE = {Renting a cloud},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {437-448},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4391},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bampis-Kononov-Letsios-Lucarelli-Sviridenko/13,
AUTHOR = {Bampis, Evripidis and Kononov, Alexander and Letsios, Dimitrios and Lucarelli, Giorgio and Sviridenko, Maxim},
TITLE = {Energy efficient scheduling and routing via randomized rounding},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {449-460},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4392},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Khodamoradi-Krishnamurti-Rafiey-Stamoulis/13,
AUTHOR = {Khodamoradi, Kamyar and Krishnamurti, Ramesh and Rafiey, Arash and Stamoulis, Georgios},
TITLE = {PTAS for ordered instances of resource allocation problems},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {461-473},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4393},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Manea-Muller-Nowotka/13,
AUTHOR = {Manea, Florin and M{\"u}ller, Mike and Nowotka, Dirk},
TITLE = {On the pseudoperiodic extension of $u^{\ell}=v^mw^n$},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {475-486},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4394},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Brazdil-Chen-Forejt-Novotny-Simaitis/13,
AUTHOR = {Br{\'a}zdil, Tom{\'a}s and Chen, Taolue and Forejt, Vojt{\v{e}}ch and Novotn{\'y}, Petr and Simaitis, Aistis},
TITLE = {Solvency Markov decision processes with interest},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {487-499},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4395},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bertrand-Fournier/13,
AUTHOR = {Bertrand, Nathalie and Fournier, Paulin},
TITLE = {Parameterized verification of many identical probabilistic timed processes},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {501-513},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4396},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Hofman-Lasota-Mayr-Totzke/13,
AUTHOR = {Hofman, Piotr and Lasota, Slawomir and Mayr, Richard and Totzke, Patrick},
TITLE = {Simulation over one-counter nets is PSPACE-complete},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {515-526},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4397},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Haar-Haddad-Melliti-Schwoon/13,
AUTHOR = {Haar, Stefan and Haddad, Serge and Melliti, Tarek and Schwoon, Stefan},
TITLE = {Optimal constructions for active diagnosis},
BOOKTITLE = {Proceedings of the 33rd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2013 (Guwahati, India, December 12-14, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {24},
PAGES = {527-539},
YEAR = {2013},
EDITOR = {Seth, Anil and K., Vishnoi Nisheeth},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4398},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Etessami/13,
AUTHOR = {Etessami, Kousha},
TITLE = {The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {1-2},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3914},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Bousquet-Lagoutte-Thomasse/13,
AUTHOR = {Bousquet, Nicolas and Lagoutte, Aur{\'e}lie and Thomass{\'e}, St{\'e}phan},
TITLE = {Graph coloring, communication complexity and the stubborn problem},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {3-4},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3915},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Mehlhorn/13,
AUTHOR = {Mehlhorn, Kurt},
TITLE = {Physarum computations},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {5-6},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3916},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
NOTE = {Invited Talk},
}
@incollection{Marx/13c,
AUTHOR = {Marx, D{\'a}niel},
TITLE = {Algorithmic graph structure theory (Tutorial)},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {7-7},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3917},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fomin-Villanger/13a,
AUTHOR = {Fomin, Fedor V. and Villanger, Yngve},
TITLE = {Searching for better fill-in},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {8-19},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3918},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bjorklund-Kaski-Kowalik/13,
AUTHOR = {Bj{\"o}rklund, Andreas and Kaski, Petteri and Kowalik, Lukasz},
TITLE = {Probably optimal graph motifs},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {20-31},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3919},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fomin-Kratsch-Pilipczuk-Pilipczuk-Villanger/13,
AUTHOR = {Fomin, Fedor V. and Kratsch, Stefan and Pilipczuk, Marcin and Pilipczuk, Michal and Villanger, Yngve},
TITLE = {Tight bounds for parameterized complexity of cluster editing},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {32-43},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3920},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Atserias-Oliva/13,
AUTHOR = {Atserias, Albert and Oliva, Sergi},
TITLE = {Bounded-width QBF is PSPACE-complete},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {44-54},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3921},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Paulusma-Slivovsky-Szeider/13,
AUTHOR = {Paulusma, Daniel and Slivovsky, Friedrich and Szeider, Stefan},
TITLE = {Model counting for CNF formulas of bounded modular treewidth},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {55-66},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3922},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Gaspers-Ordyniak-Ramanujan-Saurabh-Szeider/13,
AUTHOR = {Gaspers, Serge and Ordyniak, Sebastian and Ramanujan, M.S. and Saurabh, Saket and Szeider, Stefan},
TITLE = {Backdoors to $q$-Horn},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {67-79},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3923},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kratsch/13a,
AUTHOR = {Kratsch, Stefan},
TITLE = {On polynomial kernels for sparse integer linear programs},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {80-91},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3924},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fomin-Lokshtanov-Saurabh-Thilikos/13,
AUTHOR = {Fomin, Fedor V. and Lokshtanov, Daniel and Saurabh, Saket and Thilikos, Dimitrios M.},
TITLE = {Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {92-103},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3925},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Baartse-Meer/13,
AUTHOR = {Baartse, Martijn and Meer, Klaus},
TITLE = {The PCP theorem for NP over the reals},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {104-115},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3926},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Case-Lutz/13,
AUTHOR = {Case, Adam and Lutz, Jack H.},
TITLE = {Mutual dimension},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {116-126},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3927},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Iwata-Yoshida/13,
AUTHOR = {Iwata, Yoichi and Yoshida, Yuichi},
TITLE = {Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {127-138},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3928},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Makarychev/13,
AUTHOR = {Makarychev, Konstantin},
TITLE = {Local search is better than random assignment for bounded occurrence ordering $k$-CSPs},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {139-147},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3929},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chen-Dyer-Goldberg-Jerrum-Lu-McQuillan-Richerby/13,
AUTHOR = {Chen, Xi and Dyer, Martin and Goldberg, Leslie Ann and Jerrum, Mark and Lu, Pinyan and McQuillan, Colin and Richerby, David},
TITLE = {The complexity of approximating conservative counting CSPs},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {148-159},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3930},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ishai-Kushilevitz-Strulovich/13,
AUTHOR = {Ishai, Yuval and Kushilevitz, Eyal and Strulovich, Omer},
TITLE = {Lossy chains and fractional secret sharing},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {160-171},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3931},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Cannon-Demaine-Demaine-Eisenstat-Patitz-Schweller-Summers-Winslow/13,
AUTHOR = {Cannon, Sarah and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Patitz, Matthew J. and Schweller, Robert T. and Summers, Scott M. and Winslow, Andrew},
TITLE = {Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {172-184},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3932},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Darnstadt-Simon-Szorenyi/13,
AUTHOR = {Darnst{\"a}dt, Malte and Simon, Hans Ulrich and Sz{\"o}r{\'e}nyi, Bal{\'a}zs},
TITLE = {Unlabeled data does provably help},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {185-196},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3933},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Pilipczuk/13,
AUTHOR = {Pilipczuk, Michal},
TITLE = {Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {197-208},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3934},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Cygan-Grandoni-Kavitha/13,
AUTHOR = {Cygan, Marek and Grandoni, Fabrizio and Kavitha, Telikepalli},
TITLE = {On pairwise spanners},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {209-220},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3935},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Jeong-Kwon-Oum/13,
AUTHOR = {Jeong, Jisu and Kwon, O-joung and Oum, Sang-il},
TITLE = {Excluded vertex-minors for graphs of linear rank-width at most $k$},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {221-232},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3936},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Jez/13c,
AUTHOR = {Jez, Artur},
TITLE = {Recompression: A simple and powerful technique for word equations},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {233-244},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3937},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kociumaka-Radoszewski-Rytter/13a,
AUTHOR = {Kociumaka, Tomasz and Radoszewski, Jakub and Rytter, Wojciech},
TITLE = {Fast algorithms for Abelian periods in words and greatest common divisor queries},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {245-256},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3938},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Gawrychowski-Manea-Mercas-Nowotka-Tiseanu/13,
AUTHOR = {Gawrychowski, Pawel and Manea, Florin and Mercas, Robert and Nowotka, Dirk and Tiseanu, Catalin},
TITLE = {Finding pseudo-repetitions},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {257-268},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3939},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Abel-Demaine-Demaine-Eisenstat-Lubiw-Schulz-Souvaine-Viglietta-Winslow/13,
AUTHOR = {Abel, Zachary and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Lubiw, Anna and Schulz, Andr{\'e} and Souvaine, Diane L. and Viglietta, Giovanni and Winslow, Andrew},
TITLE = {Algorithms for designing pop-up cards},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {269-280},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3940},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Barba-Korman-Langerman-Silveira-Sadakane/13,
AUTHOR = {Barba, Luis and Korman, Matias and Langerman, Stefan and Silveira, Rodrigo I. and Sadakane, Kunihiko},
TITLE = {Space-time trade-offs for stack-based algorithms},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {281-292},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3941},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chen-Wang/13d,
AUTHOR = {Chen, Danny Z. and Wang, Haitao},
TITLE = {$L_1$ shortest path queries among polygonal obstacles in the plane},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {293-304},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3942},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kufleitner-Lauser/13,
AUTHOR = {Kufleitner, Manfred and Lauser, Alexander},
TITLE = {Quantifier alternation in two-variable first-order logic with successor is decidable},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {305-316},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3943},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Szwast-Tendera/13,
AUTHOR = {Szwast, Wieslaw and Tendera, Lidia},
TITLE = {$FO^2$ with one transitive relation is decidable},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {317-328},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3944},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Dartois-Paperman/13,
AUTHOR = {Dartois, Luc and Paperman, Charles},
TITLE = {Two-variable first order logic with modular predicates over words},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {329-340},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3945},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Wahlstrom/13,
AUTHOR = {Wahlstr{\"o}m, Magnus},
TITLE = {Abusing the Tutte matrix: An algebraic instance compression for the $K$-set-cycle problem},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {341-352},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3946},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Pilipczuk-Pilipczuk-Sankowski-van_Leeuwen/13,
AUTHOR = {Pilipczuk, Marcin and Pilipczuk, Michal and Sankowski, Piotr and van Leeuwen, Erik Jan},
TITLE = {Subexponential-time parameterized algorithm for Steiner tree on planar graphs},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {353-364},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3947},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Capelli-Durand-Mengel/13,
AUTHOR = {Capelli, Florent and Durand, Arnaud and Mengel, Stefan},
TITLE = {The arithmetic complexity of tensor contractions},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {365-376},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3948},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Hemaspaandra-Hemaspaandra-Menton/13,
AUTHOR = {Hemaspaandra, Edith and Hemaspaandra, Lane A. and Menton, Curtis},
TITLE = {Search versus decision for election manipulation problems},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {377-388},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3949},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Epstein-Levin-Segev-Weimann/13,
AUTHOR = {Epstein, Leah and Levin, Asaf and Segev, Danny and Weimann, Oren},
TITLE = {Improved bounds for online preemptive matching},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {389-399},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3950},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Jalsenius-Porat-Sach/13,
AUTHOR = {Jalsenius, Markus and Porat, Benny and Sach, Benjamin},
TITLE = {Parameterized matching in the streaming model},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {400-411},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3951},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Nasre/13,
AUTHOR = {Nasre, Meghana},
TITLE = {Popular matchings: Structure and cheating strategies},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {412-423},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3952},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Klauck-de_Wolf/13,
AUTHOR = {Klauck, Hartmut and de Wolf, Ronald},
TITLE = {Fooling one-sided quantum protocols},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {424-433},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3953},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Magnin-Roland/13,
AUTHOR = {Magnin, Lo{\"i}ck and Roland, J{\'e}r{\'e}mie},
TITLE = {Explicit relation between all lower bound techniques for quantum query complexity},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {434-445},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3954},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ambainis-Backurs-Smotrovs-de_Wolf/13,
AUTHOR = {Ambainis, Andris and Backurs, Arturs and Smotrovs, Juris and de Wolf, Ronald},
TITLE = {Optimal quantum query bounds for almost all Boolean functions},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {446-453},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3955},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Francois-Magniez/13,
AUTHOR = {Francois, Nathanael and Magniez, Fr{\'e}d{\'e}ric},
TITLE = {Streaming complexity of checking priority queues},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {454-465},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3956},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kutzkov/13,
AUTHOR = {Kutzkov, Konstantin},
TITLE = {Deterministic algorithms for skewed matrix products},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {466-477},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3957},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ma-Tang-Wang/13,
AUTHOR = {Ma, Tengyu and Tang, Bo and Wang, Yajun},
TITLE = {The simulated greedy algorithm for several submodular matroid secretary problems},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {478-489},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3958},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Jeandel-Vanier/13,
AUTHOR = {Jeandel, Emmanuel and Vanier, Pascal},
TITLE = {Hardness of conjugacy, embedding and factorization of multidimensional subshifts of finite type},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {490-501},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3959},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Klimann/13,
AUTHOR = {Klimann, Ines},
TITLE = {The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {502-513},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3960},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ben-Amram/13,
AUTHOR = {Ben-Amram, Amir M.},
TITLE = {Mortality of iterated piecewise affine functions over the integers: Decidability and complexity},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {514-525},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3961},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
PCOMMENT = {extended abstract},
}
@incollection{Bilu-Daniely-Linial-Saks/13,
AUTHOR = {Bilu, Yonatan and Daniely, Amit and Linial, Nati and Saks, Michael},
TITLE = {On the practically interesting instances of MAXCUT},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {526-537},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3962},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Dosa-Sgall/13,
AUTHOR = {D{\'o}sa, Gy{\"o}rgy and Sgall, Jiri},
TITLE = {First fit bin packing: A tight analysis},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {538-549},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3963},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Karbasi-Zadimoghaddam/13,
AUTHOR = {Karbasi, Amin and Zadimoghaddam, Morteza},
TITLE = {Constrained binary identification problem},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {550-561},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3964},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bojanczyk-Idziaszek-Skrzypczak/13,
AUTHOR = {Bojanczyk, Mikolaj and Idziaszek, Tomasz and Skrzypczak, Michal},
TITLE = {Regular languages of thin trees},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {562-573},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3965},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Colcombet-Daviaud/13,
AUTHOR = {Colcombet, Thomas and Daviaud, Laure},
TITLE = {Approximate comparison of distance automata},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {574-585},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3966},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Huschenbett/13,
AUTHOR = {Huschenbett, Martin},
TITLE = {The rank of tree-automatic linear orderings},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {586-597},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3967},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Clement-Nguyen_Thi-Vallee/13,
AUTHOR = {Cl{\'e}ment, Julien and Nguyen Thi, Thu Hien and Vall{\'e}e, Brigitte},
TITLE = {A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {598-609},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3968},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Braverman-Oshri/13,
AUTHOR = {Braverman, Mark and Oshri, Gal},
TITLE = {Search using queries on indistinguishable items},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {610-621},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3969},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Komarath-Sarma/13,
AUTHOR = {Komarath, Balagopal and Sarma, Jayalal M.N.},
TITLE = {Pebbling, entropy and branching program size lower bounds},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {622-633},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3970},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Watson/13,
AUTHOR = {Watson, Thomas},
TITLE = {Advice lower bounds for the dense model theorem},
BOOKTITLE = {Proceedings of the 30th International Symposium on Theoretical Aspects of Coputer Science, STACS'2013 (Kiel, Germany, February 27 - March 2, 2013)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
PAGES = {634-645},
YEAR = {2013},
EDITOR = {Portier, Natacha and Wilke, Thomas},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3971},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}