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/mfcs/mfcs2011.bht:"
download as .bib file
@inproceedings{DBLP:conf/mfcs/Andoni11,
author = {Alexandr Andoni},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Nearest Neighbor Search in High-Dimensional Spaces},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {1},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_1},
doi = {10.1007/978-3-642-22993-0\_1},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Andoni11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Bachrach11,
author = {Yoram Bachrach},
editor = {Filip Murlak and
Piotr Sankowski},
title = {The Least-Core of Threshold Network Flow Games},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {36--47},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_7},
doi = {10.1007/978-3-642-22993-0\_7},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Bachrach11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BaldanGS11,
author = {Paolo Baldan and
Fabio Gadducci and
Pawel Sobocinski},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Adhesivity Is Not Enough: Local Church-Rosser Revisited},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {48--59},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_8},
doi = {10.1007/978-3-642-22993-0\_8},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BaldanGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BauerFJLLT11,
author = {Sebastian S. Bauer and
Uli Fahrenberg and
Line Juhl and
Kim G. Larsen and
Axel Legay and
Claus R. Thrane},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Quantitative Refinement for Weighted Modal Transition Systems},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {60--71},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_9},
doi = {10.1007/978-3-642-22993-0\_9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BauerFJLLT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BerenbrinkEFNS11,
author = {Petra Berenbrink and
Robert Els{\"{a}}sser and
Tom Friedetzky and
Lars Nagel and
Thomas Sauerwald},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Faster Coupon Collecting via Replication with Applications in Gossiping},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {72--83},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_10},
doi = {10.1007/978-3-642-22993-0\_10},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BerenbrinkEFNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeyersdorffDMSSTV11,
author = {Olaf Beyersdorff and
Samir Datta and
Meena Mahajan and
Gido Scharfenberger{-}Fabian and
Karteek Sreenivasaiah and
Michael Thomas and
Heribert Vollmer},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Verifying Proofs in Constant Depth},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {84--95},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_11},
doi = {10.1007/978-3-642-22993-0\_11},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeyersdorffDMSSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BlaserC11,
author = {Markus Bl{\"{a}}ser and
Radu Curticapean},
editor = {Filip Murlak and
Piotr Sankowski},
title = {The Complexity of the Cover Polynomials for Planar Graphs of Bounded
Degree},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {96--107},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_12},
doi = {10.1007/978-3-642-22993-0\_12},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BlaserC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BlockeletS11,
author = {Michel Blockelet and
Sylvain Schmitz},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Model Checking Coverability Graphs of Vector Addition Systems},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {108--119},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_13},
doi = {10.1007/978-3-642-22993-0\_13},
timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BlockeletS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BogdanovKT11,
author = {Andrej Bogdanov and
Akinori Kawachi and
Hidetoki Tanaka},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Hard Functions for Low-Degree Polynomials over Prime Fields},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {120--131},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_14},
doi = {10.1007/978-3-642-22993-0\_14},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BogdanovKT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BohmG11,
author = {Stanislav B{\"{o}}hm and
Stefan G{\"{o}}ller},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Language Equivalence of Deterministic Real-Time One-Counter Automata
Is NL-Complete},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {194--205},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_20},
doi = {10.1007/978-3-642-22993-0\_20},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BohmG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BolligCGZ11,
author = {Benedikt Bollig and
Aiswarya Cyriac and
Paul Gastin and
Marc Zeitoun},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Temporal Logics for Concurrent Recursive Programs: Satisfiability
and Model Checking},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {132--144},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_15},
doi = {10.1007/978-3-642-22993-0\_15},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BolligCGZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Bonnet11,
author = {R{\'{e}}mi Bonnet},
editor = {Filip Murlak and
Piotr Sankowski},
title = {The Reachability Problem for Vector Addition System with One Zero-Test},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {145--157},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_16},
doi = {10.1007/978-3-642-22993-0\_16},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Bonnet11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Boom11,
author = {Michael {Vanden Boom}},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Weak Cost Monadic Logic over Infinite Trees},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {580--591},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_52},
doi = {10.1007/978-3-642-22993-0\_52},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Boom11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Boucher11,
author = {Christina Boucher},
editor = {Filip Murlak and
Piotr Sankowski},
title = {The Bounded Search Tree Algorithm for the Closest String Problem Has
Quadratic Smoothed Complexity},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {158--169},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_17},
doi = {10.1007/978-3-642-22993-0\_17},
timestamp = {Mon, 10 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Boucher11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BournezGP11,
author = {Olivier Bournez and
Daniel Silva Gra{\c{c}}a and
Amaury Pouly},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Solving Analytic Differential Equations in Polynomial Time over Unbounded
Domains},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {170--181},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_18},
doi = {10.1007/978-3-642-22993-0\_18},
timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BournezGP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BredereckNNP11,
author = {Robert Bredereck and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Geevarghese Philip},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Pattern-Guided Data Anonymization and Clustering},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {182--193},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_19},
doi = {10.1007/978-3-642-22993-0\_19},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BredereckNNP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CateF11,
author = {Balder ten Cate and
Alessandro Facchini},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Characterizing {EF} over Infinite Trees and Modal Logic on Transitive
Graphs},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {290--302},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_28},
doi = {10.1007/978-3-642-22993-0\_28},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CateF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChatterjeeD11,
author = {Krishnendu Chatterjee and
Laurent Doyen},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Energy and Mean-Payoff Parity Markov Decision Processes},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {206--218},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_21},
doi = {10.1007/978-3-642-22993-0\_21},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChatterjeeD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChrzaszczS11,
author = {Jacek Chrzaszcz and
Aleksy Schubert},
editor = {Filip Murlak and
Piotr Sankowski},
title = {The Role of Polymorphism in the Characterisation of Complexity by
Soft Types},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {219--230},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_22},
doi = {10.1007/978-3-642-22993-0\_22},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChrzaszczS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CohenCJZ11,
author = {David A. Cohen and
P{\'{a}}id{\'{\i}} Creed and
Peter G. Jeavons and
Stanislav Zivn{\'{y}}},
editor = {Filip Murlak and
Piotr Sankowski},
title = {An Algebraic Theory of Complexity for Valued Constraints: Establishing
a Galois Connection},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {231--242},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_23},
doi = {10.1007/978-3-642-22993-0\_23},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CohenCJZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ColcombetLP11,
author = {Thomas Colcombet and
Clemens Ley and
Gabriele Puppis},
editor = {Filip Murlak and
Piotr Sankowski},
title = {On the Use of Guards for Logics with Data},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {243--255},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_24},
doi = {10.1007/978-3-642-22993-0\_24},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ColcombetLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DemenkovK11,
author = {Evgeny Demenkov and
Alexander S. Kulikov},
editor = {Filip Murlak and
Piotr Sankowski},
title = {An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity
of Affine Dispersers},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {256--265},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_25},
doi = {10.1007/978-3-642-22993-0\_25},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DemenkovK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DondiMZ11,
author = {Riccardo Dondi and
Giancarlo Mauri and
Italo Zoppis},
editor = {Filip Murlak and
Piotr Sankowski},
title = {On the Complexity of the l-diversity Problem},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {266--277},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_26},
doi = {10.1007/978-3-642-22993-0\_26},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DondiMZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DoyenMS11,
author = {Laurent Doyen and
Thierry Massart and
Mahsa Shirmohammadi},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Infinite Synchronizing Words for Probabilistic Automata},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {278--289},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_27},
doi = {10.1007/978-3-642-22993-0\_27},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DoyenMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FearnleyL11,
author = {John Fearnley and
Oded Lachish},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Parity Games on Graphs with Medium Tree-Width},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {303--314},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_29},
doi = {10.1007/978-3-642-22993-0\_29},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FearnleyL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Flum11,
author = {J{\"{o}}rg Flum},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Invariantization of Listings},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {2},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_2},
doi = {10.1007/978-3-642-22993-0\_2},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Flum11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FranekRZ11,
author = {Peter Franek and
Stefan Ratschan and
Piotr Zgliczynski},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Satisfiability of Systems of Equations of Real Analytic Functions
Is Quasi-decidable},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {315--326},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_30},
doi = {10.1007/978-3-642-22993-0\_30},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FranekRZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FridmanP11,
author = {Wladimir Fridman and
Bernd Puchala},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Distributed Synthesis for Regular and Contextfree Specifications},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {532--543},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_48},
doi = {10.1007/978-3-642-22993-0\_48},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FridmanP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiJM11,
author = {Pawel Gawrychowski and
Artur Jez and
Andreas Maletti},
editor = {Filip Murlak and
Piotr Sankowski},
title = {On Minimising Automata with Errors},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {327--338},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_31},
doi = {10.1007/978-3-642-22993-0\_31},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GawrychowskiJM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Gehrke11,
author = {Mai Gehrke},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Duality and Recognition},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {3--18},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_3},
doi = {10.1007/978-3-642-22993-0\_3},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Gehrke11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovachKP11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Contracting a Chordal Graph to a Split Graph or a Tree},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {339--350},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_32},
doi = {10.1007/978-3-642-22993-0\_32},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GolovachKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovkinsKK11,
author = {Marats Golovkins and
Maksim Kravtsev and
Vasilijs Kravcevs},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial
Idempotent Languages},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {351--363},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_33},
doi = {10.1007/978-3-642-22993-0\_33},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GolovkinsKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraS11,
author = {Edith Hemaspaandra and
Henning Schnoor},
editor = {Filip Murlak and
Piotr Sankowski},
title = {A Universally Defined Undecidable Unimodal Logic},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {364--375},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_34},
doi = {10.1007/978-3-642-22993-0\_34},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HosodaHIOSW11,
author = {Jun Hosoda and
Juraj Hromkovic and
Taisuke Izumi and
Hirotaka Ono and
Monika Steinov{\'{a}} and
Koichi Wada},
editor = {Filip Murlak and
Piotr Sankowski},
title = {On the Approximability of Minimum Topic Connected Overlay and Its
Special Instances},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {376--387},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_35},
doi = {10.1007/978-3-642-22993-0\_35},
timestamp = {Fri, 19 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/HosodaHIOSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KermarrecT11,
author = {Anne{-}Marie Kermarrec and
Christopher Thraves},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Can Everybody Sit Closer to Their Friends Than Their Enemies?},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {388--399},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_36},
doi = {10.1007/978-3-642-22993-0\_36},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KermarrecT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Kirsten11,
author = {Daniel Kirsten},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Some Variants of the Star Height Problem},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {19--33},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_4},
doi = {10.1007/978-3-642-22993-0\_4},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Kirsten11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Kolmogorov11,
author = {Vladimir Kolmogorov},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Submodularity on a Tree: Unifying {\textdollar}L{\textbackslash}natural{\textdollar}
-Convex and Bisubmodular Functions},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {400--411},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_37},
doi = {10.1007/978-3-642-22993-0\_37},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Kolmogorov11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KrebsLS11,
author = {Andreas Krebs and
Nutan Limaye and
Srikanth Srinivasan},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {412--423},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_38},
doi = {10.1007/978-3-642-22993-0\_38},
timestamp = {Tue, 17 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KrebsLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KrzywdzinskiR11,
author = {Krzysztof Krzywdzinski and
Katarzyna Rybarczyk},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing
Protocols},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {544--555},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_49},
doi = {10.1007/978-3-642-22993-0\_49},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KrzywdzinskiR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KuskeW11,
author = {Dietrich Kuske and
Thomas Weidner},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Size and Computation of Injective Tree Automatic Presentations},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {424--435},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_39},
doi = {10.1007/978-3-642-22993-0\_39},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KuskeW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LiptonRR11,
author = {Richard J. Lipton and
Kenneth W. Regan and
Atri Rudra},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Symmetric Functions Capture General Functions},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {436--447},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_40},
doi = {10.1007/978-3-642-22993-0\_40},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LiptonRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Lohrey11,
author = {Markus Lohrey},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Compressed Word Problems for Inverse Monoids},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {448--459},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_41},
doi = {10.1007/978-3-642-22993-0\_41},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Lohrey11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MalettiQ11,
author = {Andreas Maletti and
Daniel Quernheim},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Pushing for Weighted Tree Automata},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {460--471},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_42},
doi = {10.1007/978-3-642-22993-0\_42},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MalettiQ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ManeaMT11,
author = {Florin Manea and
Robert Mercas and
Catalin Tiseanu},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Periodicity Algorithms for Partial Words},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {472--484},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_43},
doi = {10.1007/978-3-642-22993-0\_43},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ManeaMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/OkhotinS11,
author = {Alexander Okhotin and
Kai Salomaa},
editor = {Filip Murlak and
Piotr Sankowski},
title = {State Complexity of Operations on Input-Driven Pushdown Automata},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {485--496},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_44},
doi = {10.1007/978-3-642-22993-0\_44},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/OkhotinS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PaulPT11,
author = {Christophe Paul and
Anthony Perez and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense
{RTI} and a Related Problem},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {497--507},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_45},
doi = {10.1007/978-3-642-22993-0\_45},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/PaulPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PerrotR11,
author = {K{\'{e}}vin Perrot and
Eric R{\'{e}}mila},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Transduction on Kadanoff Sand Pile Model Avalanches, Application to
Wave Pattern Emergence},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {508--519},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_46},
doi = {10.1007/978-3-642-22993-0\_46},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/PerrotR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Pilipczuk11,
author = {Michal Pilipczuk},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Problems Parameterized by Treewidth Tractable in Single Exponential
Time: {A} Logical Approach},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {520--531},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_47},
doi = {10.1007/978-3-642-22993-0\_47},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Pilipczuk11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Raghavendra11,
author = {Prasad Raghavendra},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Generic Techniques to Round {SDP} Relaxations},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {34},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_5},
doi = {10.1007/978-3-642-22993-0\_5},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Raghavendra11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Sankur11,
author = {Ocan Sankur},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Untimed Language Preservation in Timed Systems},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {556--567},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_50},
doi = {10.1007/978-3-642-22993-0\_50},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Sankur11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/UchizawaT11,
author = {Kei Uchizawa and
Eiji Takimoto},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Lower Bounds for Linear Decision Trees via an Energy Complexity Argument},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {568--579},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_51},
doi = {10.1007/978-3-642-22993-0\_51},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/UchizawaT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/WangYGC11,
author = {Jianxin Wang and
Yongjie Yang and
Jiong Guo and
Jianer Chen},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Linear Problem Kernels for Planar Graph Problems with Small Distance
Property},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {592--603},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_53},
doi = {10.1007/978-3-642-22993-0\_53},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/WangYGC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Wollan11,
author = {Paul Wollan},
editor = {Filip Murlak and
Piotr Sankowski},
title = {New Proofs in Graph Minors},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {35},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_6},
doi = {10.1007/978-3-642-22993-0\_6},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Wollan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/XiaoKP11,
author = {Mingyu Xiao and
Ton Kloks and
Sheung{-}Hung Poon},
editor = {Filip Murlak and
Piotr Sankowski},
title = {New Parameterized Algorithms for the Edge Dominating Set Problem},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {604--615},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_54},
doi = {10.1007/978-3-642-22993-0\_54},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/XiaoKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2011,
editor = {Filip Murlak and
Piotr Sankowski},
title = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0},
doi = {10.1007/978-3-642-22993-0},
isbn = {978-3-642-22992-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2011.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-06-23 08:38 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:
