Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/stacs/stacs2004.bht:"
download as .bib file
@inproceedings{DBLP:conf/stacs/AignerMM04,
author = {Martin Aigner and
Gianluca De Marco and
Manuela Montangero},
editor = {Volker Diekert and
Michel Habib},
title = {The Plurality Problem with Three Colors},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {513--521},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_45},
doi = {10.1007/978-3-540-24749-4\_45},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AignerMM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AllenderBK04,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}}},
editor = {Volker Diekert and
Michel Habib},
title = {What Can be Efficiently Reduced to the K-Random Strings?},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {584--595},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_51},
doi = {10.1007/978-3-540-24749-4\_51},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AllenderBK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AmbainisBGKMT04,
author = {Andris Ambainis and
Martin Beaudry and
Marats Golovkins and
Arnolds Kikusts and
Mark Mercer and
Denis Th{\'{e}}rien},
editor = {Volker Diekert and
Michel Habib},
title = {Algebraic Results on Quantum Automata},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {93--104},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_9},
doi = {10.1007/978-3-540-24749-4\_9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbainisBGKMT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AmbainisIKMPY04,
author = {Andris Ambainis and
Kazuo Iwama and
Akinori Kawachi and
Hiroyuki Masuda and
Raymond H. Putra and
Shigeru Yamashita},
editor = {Volker Diekert and
Michel Habib},
title = {Quantum Identification of Boolean Oracles},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {105--116},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_10},
doi = {10.1007/978-3-540-24749-4\_10},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbainisIKMPY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AmbuhlCILMPRS04,
author = {Christoph Amb{\"{u}}hl and
Andrea E. F. Clementi and
Miriam Di Ianni and
Nissan Lev{-}Tov and
Angelo Monti and
David Peleg and
Gianluca Rossi and
Riccardo Silvestri},
editor = {Volker Diekert and
Michel Habib},
title = {Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc
Wireless Networks},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {418--427},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_37},
doi = {10.1007/978-3-540-24749-4\_37},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbuhlCILMPRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AmbuhlW04,
author = {Christoph Amb{\"{u}}hl and
Birgitta Weber},
editor = {Volker Diekert and
Michel Habib},
title = {Parallel Prefetching and Caching Is Hard},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {211--221},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_19},
doi = {10.1007/978-3-540-24749-4\_19},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbuhlW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AthreyaHLM04,
author = {Krishna B. Athreya and
John M. Hitchcock and
Jack H. Lutz and
Elvira Mayordomo},
editor = {Volker Diekert and
Michel Habib},
title = {Effective Strong Dimension in Algorithmic Information and Computational
Complexity},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {632--643},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_55},
doi = {10.1007/978-3-540-24749-4\_55},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AthreyaHLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AulettaPPP04,
author = {Vincenzo Auletta and
Roberto De Prisco and
Paolo Penna and
Giuseppe Persiano},
editor = {Volker Diekert and
Michel Habib},
title = {Deterministic Truthful Approximation Mechanisms for Scheduling Related
Machines},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {608--619},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_53},
doi = {10.1007/978-3-540-24749-4\_53},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AulettaPPP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bala04,
author = {Sebastian Bala},
editor = {Volker Diekert and
Michel Habib},
title = {Regular Language Matching and Other Decidable Cases of the Satisfiability
Problem for Constraints between Regular Open Terms},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {596--607},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_52},
doi = {10.1007/978-3-540-24749-4\_52},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bala04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BarbanchonG04,
author = {R{\'{e}}gis Barbanchon and
Etienne Grandjean},
editor = {Volker Diekert and
Michel Habib},
title = {The Minimal Logically-Defined NP-Complete Problem},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {338--349},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_30},
doi = {10.1007/978-3-540-24749-4\_30},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BarbanchonG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BartalCCFJLST04,
author = {Yair Bartal and
Francis Y. L. Chin and
Marek Chrobak and
Stanley P. Y. Fung and
Wojciech Jawor and
Ron Lavi and
Jir{\'{\i}} Sgall and
Tom{\'{a}}s Tich{\'{y}}},
editor = {Volker Diekert and
Michel Habib},
title = {Online Competitive Algorithms for Maximizing Weighted Throughput of
Unit Jobs},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {187--198},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_17},
doi = {10.1007/978-3-540-24749-4\_17},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BartalCCFJLST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BastMST04,
author = {Hannah Bast and
Kurt Mehlhorn and
Guido Sch{\"{a}}fer and
Hisao Tamaki},
editor = {Volker Diekert and
Michel Habib},
title = {Matching Algorithms Are Fast in Sparse Random Graphs},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {81--92},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_8},
doi = {10.1007/978-3-540-24749-4\_8},
timestamp = {Mon, 14 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BastMST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BealFP04,
author = {Marie{-}Pierre B{\'{e}}al and
Francesca Fiorenzi and
Dominique Perrin},
editor = {Volker Diekert and
Michel Habib},
title = {The Syntactic Graph of a Sofic Shift},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {282--293},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_25},
doi = {10.1007/978-3-540-24749-4\_25},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BealFP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BertoniCGL04,
author = {Alberto Bertoni and
Christian Choffrut and
Massimiliano Goldwurm and
Violetta Lonati},
editor = {Volker Diekert and
Michel Habib},
title = {Local Limit Distributions in Pattern Statistics: Beyond the Markovian
Models},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {117--128},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_11},
doi = {10.1007/978-3-540-24749-4\_11},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BertoniCGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BohlerHRV04,
author = {Elmar B{\"{o}}hler and
Edith Hemaspaandra and
Steffen Reith and
Heribert Vollmer},
editor = {Volker Diekert and
Michel Habib},
title = {The Complexity of Boolean Constraint Isomorphism},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {164--175},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_15},
doi = {10.1007/978-3-540-24749-4\_15},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BohlerHRV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BritoGV04,
author = {Carlos Brito and
Eli Gafni and
Shailesh Vaya},
editor = {Volker Diekert and
Michel Habib},
title = {An Information Theoretic Lower Bound for Broadcasting in Radio Networks},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {534--546},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_47},
doi = {10.1007/978-3-540-24749-4\_47},
timestamp = {Sat, 04 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BritoGV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanKVV04,
author = {Harry Buhrman and
Hartmut Klauck and
Nikolai K. Vereshchagin and
Paul M. B. Vit{\'{a}}nyi},
editor = {Volker Diekert and
Michel Habib},
title = {Individual Communication Complexity: Extended Abstract},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {19--30},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_3},
doi = {10.1007/978-3-540-24749-4\_3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanKVV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BustanKV04,
author = {Doron Bustan and
Orna Kupferman and
Moshe Y. Vardi},
editor = {Volker Diekert and
Michel Habib},
title = {A Measured Collapse of the Modal {\(\mathrm{\mu}\)}-Calculus Alternation
Hierarchy},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {522--533},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_46},
doi = {10.1007/978-3-540-24749-4\_46},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BustanKV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaiCM04,
author = {Jin{-}yi Cai and
Venkatesan T. Chakaravarthy and
Dieter van Melkebeek},
editor = {Volker Diekert and
Michel Habib},
title = {Time-Space Tradeoff in Derandomizing Probabilistic Logspace},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {571--583},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_50},
doi = {10.1007/978-3-540-24749-4\_50},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaiCM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaragiannisK04,
author = {Ioannis Caragiannis and
Christos Kaklamanis},
editor = {Volker Diekert and
Michel Habib},
title = {Approximate Path Coloring with Applications to Wavelength Assignment
in {WDM} Optical Networks},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {258--269},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_23},
doi = {10.1007/978-3-540-24749-4\_23},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaragiannisK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChrobakS04,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
editor = {Volker Diekert and
Michel Habib},
title = {Errata to Analysis of the Harmonic Algorithm for Three Servers},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {656},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_57},
doi = {10.1007/978-3-540-24749-4\_57},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ChrobakS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CohenCJK04,
author = {David A. Cohen and
Martin C. Cooper and
Peter Jeavons and
Andrei A. Krokhin},
editor = {Volker Diekert and
Michel Habib},
title = {Identifying Efficiently Solvable Cases of Max {CSP}},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {152--163},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_14},
doi = {10.1007/978-3-540-24749-4\_14},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/CohenCJK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ColcombetL04,
author = {Thomas Colcombet and
Christof L{\"{o}}ding},
editor = {Volker Diekert and
Michel Habib},
title = {On the Expressiveness of Deterministic Transducers over Infinite Trees},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {428--439},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_38},
doi = {10.1007/978-3-540-24749-4\_38},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ColcombetL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DantsinHW04,
author = {Evgeny Dantsin and
Edward A. Hirsch and
Alexander Wolpert},
editor = {Volker Diekert and
Michel Habib},
title = {Algorithms for {SAT} Based on Search in Hamming Balls},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {141--151},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_13},
doi = {10.1007/978-3-540-24749-4\_13},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DantsinHW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DhamdhereGR04,
author = {Kedar Dhamdhere and
Anupam Gupta and
R. Ravi},
editor = {Volker Diekert and
Michel Habib},
title = {Approximation Algorithms for Minimizing Average Distortion},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {234--245},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_21},
doi = {10.1007/978-3-540-24749-4\_21},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DhamdhereGR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DuchonHSZ04,
author = {Philippe Duchon and
Nicolas Hanusse and
Nasser Saheb and
Akka Zemmari},
editor = {Volker Diekert and
Michel Habib},
title = {Broadcast in the Rendezvous Model},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {559--570},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_49},
doi = {10.1007/978-3-540-24749-4\_49},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DuchonHSZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EbenlendrS04,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
editor = {Volker Diekert and
Michel Habib},
title = {Optimal and Online Preemptive Scheduling on Uniformly Related Machines},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {199--210},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_18},
doi = {10.1007/978-3-540-24749-4\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EbenlendrS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ErlebachJMNSW04,
author = {Thomas Erlebach and
Riko Jacob and
Mat{\'{u}}s Mihal{\'{a}}k and
Marc Nunkesser and
G{\'{a}}bor Szab{\'{o}} and
Peter Widmayer},
editor = {Volker Diekert and
Michel Habib},
title = {An Algorithmic View on {OVSF} Code Assignment},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {270--281},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_24},
doi = {10.1007/978-3-540-24749-4\_24},
timestamp = {Thu, 26 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ErlebachJMNSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FominT04,
author = {Fedor V. Fomin and
Dimitrios M. Thilikos},
editor = {Volker Diekert and
Michel Habib},
title = {A Simple and Fast Approach for Solving Problems on Planar Graphs},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {56--67},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_6},
doi = {10.1007/978-3-540-24749-4\_6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FominT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FraigniaudI04,
author = {Pierre Fraigniaud and
David Ilcinkas},
editor = {Volker Diekert and
Michel Habib},
title = {Digraphs Exploration with Little Memory},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {246--257},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_22},
doi = {10.1007/978-3-540-24749-4\_22},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FraigniaudI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GanapathyL04,
author = {Murali K. Ganapathy and
Sachin Lodha},
editor = {Volker Diekert and
Michel Habib},
title = {On Minimum Circular Arrangement},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {394--405},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_35},
doi = {10.1007/978-3-540-24749-4\_35},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GanapathyL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GoldbergHKS04,
author = {Andrew V. Goldberg and
Jason D. Hartline and
Anna R. Karlin and
Michael E. Saks},
editor = {Volker Diekert and
Michel Habib},
title = {A Lower Bound on the Competitive Ratio of Truthful Auctions},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {644--655},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_56},
doi = {10.1007/978-3-540-24749-4\_56},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GoldbergHKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Gradel04,
author = {Erich Gr{\"{a}}del},
editor = {Volker Diekert and
Michel Habib},
title = {Positional Determinacy of Infinite Games},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {4--18},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_2},
doi = {10.1007/978-3-540-24749-4\_2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Gradel04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hagerup04,
author = {Torben Hagerup},
editor = {Volker Diekert and
Michel Habib},
title = {Simpler Computation of Single-Source Shortest Paths in Linear Average
Time},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {362--369},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_32},
doi = {10.1007/978-3-540-24749-4\_32},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hagerup04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hansen04,
author = {Kristoffer Arnsfelt Hansen},
editor = {Volker Diekert and
Michel Habib},
title = {Constant Width Planar Computation Characterizes ACC\({}^{\mbox{0}}\)},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {44--55},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_5},
doi = {10.1007/978-3-540-24749-4\_5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HarjuN04,
author = {Tero Harju and
Dirk Nowotka},
editor = {Volker Diekert and
Michel Habib},
title = {Periodicity and Unbordered Words: {A} Proof of Duval?s Conjecture},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {294--304},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_26},
doi = {10.1007/978-3-540-24749-4\_26},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HarjuN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jarry04,
author = {Aubin Jarry},
editor = {Volker Diekert and
Michel Habib},
title = {Integral Symmetric 2-Commodity Flows},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {406--417},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_36},
doi = {10.1007/978-3-540-24749-4\_36},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jarry04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Johannsen04,
author = {Jan Johannsen},
editor = {Volker Diekert and
Michel Habib},
title = {Satisfiability Problems Complete for Deterministic Logarithmic Space},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {317--325},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_28},
doi = {10.1007/978-3-540-24749-4\_28},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Johannsen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KavithaMMP04,
author = {Telikepalli Kavitha and
Kurt Mehlhorn and
Dimitrios Michail and
Katarzyna E. Paluch},
editor = {Volker Diekert and
Michel Habib},
title = {Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents
Problem},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {222--233},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_20},
doi = {10.1007/978-3-540-24749-4\_20},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KavithaMMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kenyon04,
author = {Claire Kenyon},
editor = {Volker Diekert and
Michel Habib},
title = {Approximation Schemes for Metric Clustering Problems},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {1--3},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_1},
doi = {10.1007/978-3-540-24749-4\_1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kenyon04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KhoussainovRS04,
author = {Bakhadyr Khoussainov and
Sasha Rubin and
Frank Stephan},
editor = {Volker Diekert and
Michel Habib},
title = {Definability and Regularity in Automatic Structures},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {440--451},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_39},
doi = {10.1007/978-3-540-24749-4\_39},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KhoussainovRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kirsten04,
author = {Daniel Kirsten},
editor = {Volker Diekert and
Michel Habib},
title = {Desert Automata and the Finite Substitution Problem},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {305--316},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_27},
doi = {10.1007/978-3-540-24749-4\_27},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kirsten04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KolliopoulosS04,
author = {Stavros G. Kolliopoulos and
George Steiner},
editor = {Volker Diekert and
Michel Habib},
title = {On Minimizing the Total Weighted Tardiness on a Single Machine},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {176--186},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_16},
doi = {10.1007/978-3-540-24749-4\_16},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KolliopoulosS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kovacs04,
author = {Annam{\'{a}}ria Kov{\'{a}}cs},
editor = {Volker Diekert and
Michel Habib},
title = {Sum-Multicoloring on Paths},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {68--80},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_7},
doi = {10.1007/978-3-540-24749-4\_7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kovacs04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KustersW04,
author = {Ralf K{\"{u}}sters and
Thomas Wilke},
editor = {Volker Diekert and
Michel Habib},
title = {Automata-Based Analysis of Recursive Cryptographic Protocols},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {382--393},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_34},
doi = {10.1007/978-3-540-24749-4\_34},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KustersW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Laber04,
author = {Eduardo Sany Laber},
editor = {Volker Diekert and
Michel Habib},
title = {A Randomized Competitive Algorithm for Evaluating Priced {AND/OR}
Trees},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {501--512},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_44},
doi = {10.1007/978-3-540-24749-4\_44},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Laber04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LuckingMMR04,
author = {Thomas L{\"{u}}cking and
Marios Mavronicolas and
Burkhard Monien and
Manuel Rode},
editor = {Volker Diekert and
Michel Habib},
title = {A New Model for Selfish Routing},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {547--558},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_48},
doi = {10.1007/978-3-540-24749-4\_48},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LuckingMMR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MuschollSS04,
author = {Anca Muscholl and
Thomas Schwentick and
Luc Segoufin},
editor = {Volker Diekert and
Michel Habib},
title = {Active Context-Free Games},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {452--464},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_40},
doi = {10.1007/978-3-540-24749-4\_40},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MuschollSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Palbom04,
author = {Anna Palbom},
editor = {Volker Diekert and
Michel Habib},
title = {Worst Case Performance of an Approximation Algorithm for Asymmetric
{TSP}},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {465--476},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_41},
doi = {10.1007/978-3-540-24749-4\_41},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Palbom04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Reidenbach04,
author = {Daniel Reidenbach},
editor = {Volker Diekert and
Michel Habib},
title = {A Discontinuity in Pattern Inference},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {129--140},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_12},
doi = {10.1007/978-3-540-24749-4\_12},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Reidenbach04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SchaferS04,
author = {Guido Sch{\"{a}}fer and
Naveen Sivadasan},
editor = {Volker Diekert and
Michel Habib},
title = {Topology Matters: Smoothed Competitiveness of Metrical Task Systems},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {489--500},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_43},
doi = {10.1007/978-3-540-24749-4\_43},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SchaferS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schwarz04,
author = {Bernhard Schwarz},
editor = {Volker Diekert and
Michel Habib},
title = {The Complexity of Satisfiability Problems over Finite Lattices},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {31--43},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_4},
doi = {10.1007/978-3-540-24749-4\_4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Schwarz04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SouzaS04,
author = {Alexander Souza and
Angelika Steger},
editor = {Volker Diekert and
Michel Habib},
title = {The Expected Competitive Ratio for Weighted Completion Time Scheduling},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {620--631},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_54},
doi = {10.1007/978-3-540-24749-4\_54},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SouzaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Tantau04,
author = {Till Tantau},
editor = {Volker Diekert and
Michel Habib},
title = {A Logspace Approximation Scheme for the Shortest Path Problem for
Graphs with Bounded Independence Number},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {326--337},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_29},
doi = {10.1007/978-3-540-24749-4\_29},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Tantau04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Tholey04,
author = {Torsten Tholey},
editor = {Volker Diekert and
Michel Habib},
title = {Solving the 2-Disjoint Paths Problem in Nearly Linear Time},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {350--361},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_31},
doi = {10.1007/978-3-540-24749-4\_31},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Tholey04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Trolin04,
author = {M{\aa}rten Trolin},
editor = {Volker Diekert and
Michel Habib},
title = {Lattices with Many Cycles Are Dense},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {370--381},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_33},
doi = {10.1007/978-3-540-24749-4\_33},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Trolin04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ZhangH04,
author = {Huaming Zhang and
Xin He},
editor = {Volker Diekert and
Michel Habib},
title = {On Visibility Representation of Plane Graphs},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {477--488},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_42},
doi = {10.1007/978-3-540-24749-4\_42},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ZhangH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2004,
editor = {Volker Diekert and
Michel Habib},
title = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b96012},
doi = {10.1007/B96012},
isbn = {3-540-21236-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-31 15:32 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
