BibTeX records: Radu Curticapean

download as .bib file

@inproceedings{DBLP:conf/icalp/BezakovaCDF17,
  author    = {Ivona Bez{\'{a}}kov{\'{a}} and
               Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin},
  title     = {Finding Detours is Fixed-Parameter Tractable},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  pages     = {54:1--54:14},
  year      = {2017},
  crossref  = {DBLP:conf/icalp/2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.54},
  doi       = {10.4230/LIPIcs.ICALP.2017.54},
  timestamp = {Tue, 18 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/BezakovaCDF17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CurticapeanDR17,
  author    = {Radu Curticapean and
               Holger Dell and
               Marc Roth},
  title     = {Counting Edge-Injective Homomorphisms and Matchings on Restricted
               Graph Classes},
  booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2017, March 8-11, 2017, Hannover, Germany},
  pages     = {25:1--25:15},
  year      = {2017},
  crossref  = {DBLP:conf/stacs/2017},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2017.25},
  doi       = {10.4230/LIPIcs.STACS.2017.25},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/CurticapeanDR17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CurticapeanDM17,
  author    = {Radu Curticapean and
               Holger Dell and
               D{\'{a}}niel Marx},
  title     = {Homomorphisms are a good basis for counting small subgraphs},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {210--223},
  year      = {2017},
  crossref  = {DBLP:conf/stoc/2017},
  url       = {http://doi.acm.org/10.1145/3055399.3055502},
  doi       = {10.1145/3055399.3055502},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/CurticapeanDM17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanDR17,
  author    = {Radu Curticapean and
               Holger Dell and
               Marc Roth},
  title     = {Counting edge-injective homomorphisms and matchings on restricted
               graph classes},
  journal   = {CoRR},
  volume    = {abs/1702.05447},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.05447},
  archivePrefix = {arXiv},
  eprint    = {1702.05447},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/CurticapeanDR17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanDFGL17,
  author    = {Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin and
               Leslie Ann Goldberg and
               John Lapinskas},
  title     = {A Fixed-Parameter Perspective on {\#}BIS},
  journal   = {CoRR},
  volume    = {abs/1702.05543},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.05543},
  archivePrefix = {arXiv},
  eprint    = {1702.05543},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/CurticapeanDFGL17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanDM17,
  author    = {Radu Curticapean and
               Holger Dell and
               D{\'{a}}niel Marx},
  title     = {Homomorphisms Are a Good Basis for Counting Small Subgraphs},
  journal   = {CoRR},
  volume    = {abs/1705.01595},
  year      = {2017},
  url       = {http://arxiv.org/abs/1705.01595},
  archivePrefix = {arXiv},
  eprint    = {1705.01595},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/CurticapeanDM17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02311,
  author    = {Radu Curticapean and
               Nathan Lindzey and
               Jesper Nederlof},
  title     = {A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank},
  journal   = {CoRR},
  volume    = {abs/1709.02311},
  year      = {2017},
  url       = {http://arxiv.org/abs/1709.02311},
  archivePrefix = {arXiv},
  eprint    = {1709.02311},
  timestamp = {Thu, 05 Oct 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1709-02311},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eatcs/Curticapean16,
  author    = {Radu Curticapean},
  title     = {The simple, little and slow things count: on parameterized counting
               complexity},
  journal   = {Bulletin of the {EATCS}},
  volume    = {120},
  year      = {2016},
  url       = {http://bulletin.eatcs.org/index.php/beatcs/article/view/445/453},
  timestamp = {Mon, 24 Apr 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eatcs/Curticapean16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/esa/Curticapean16,
  author    = {Radu Curticapean},
  title     = {Counting Matchings with k Unmatched Vertices in Planar Graphs},
  booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
               2016, Aarhus, Denmark},
  pages     = {33:1--33:17},
  year      = {2016},
  crossref  = {DBLP:conf/esa/2016},
  url       = {https://doi.org/10.4230/LIPIcs.ESA.2016.33},
  doi       = {10.4230/LIPIcs.ESA.2016.33},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/Curticapean16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Curticapean16,
  author    = {Radu Curticapean},
  title     = {Parity Separation: {A} Scientifically Proven Method for Permanent
               Weight Loss},
  booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  pages     = {47:1--47:14},
  year      = {2016},
  crossref  = {DBLP:conf/icalp/2016},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2016.47},
  doi       = {10.4230/LIPIcs.ICALP.2016.47},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/Curticapean16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/CurticapeanM16,
  author    = {Radu Curticapean and
               D{\'{a}}niel Marx},
  title     = {Tight conditional lower bounds for counting perfect matchings on graphs
               of bounded treewidth, cliquewidth, and genus},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages     = {1650--1669},
  year      = {2016},
  crossref  = {DBLP:conf/soda/2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch113},
  doi       = {10.1137/1.9781611974331.ch113},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/CurticapeanM16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/BezakovaCDF16,
  author    = {Ivona Bez{\'{a}}kov{\'{a}} and
               Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin},
  title     = {Finding Detours is Fixed-parameter Tractable},
  journal   = {CoRR},
  volume    = {abs/1607.07737},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.07737},
  archivePrefix = {arXiv},
  eprint    = {1607.07737},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/BezakovaCDF16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Curticapean16,
  author    = {Radu Curticapean},
  title     = {Counting matchings with k unmatched vertices in planar graphs},
  journal   = {CoRR},
  volume    = {abs/1607.08192},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.08192},
  archivePrefix = {arXiv},
  eprint    = {1607.08192},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Curticapean16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Curticapean15,
  author    = {Radu Curticapean},
  title     = {The simple, little and slow things count: on parameterized counting
               complexity},
  school    = {Saarland University},
  year      = {2015},
  url       = {http://scidok.sulb.uni-saarland.de/volltexte/2015/6217/},
  urn       = {urn:nbn:de:bsz:291-scidok-62178},
  timestamp = {Mon, 18 Apr 2016 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/phd/dnb/Curticapean15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/CurticapeanK15,
  author    = {Radu Curticapean and
               Marvin K{\"{u}}nnemann},
  title     = {A Quantization Framework for Smoothed Analysis of Euclidean Optimization
               Problems},
  journal   = {Algorithmica},
  volume    = {73},
  number    = {3},
  pages     = {483--510},
  year      = {2015},
  url       = {https://doi.org/10.1007/s00453-015-0043-5},
  doi       = {10.1007/s00453-015-0043-5},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/CurticapeanK15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dcg/AlvarezBCR15,
  author    = {Victor Alvarez and
               Karl Bringmann and
               Radu Curticapean and
               Saurabh Ray},
  title     = {Counting Triangulations and Other Crossing-Free Structures via Onion
               Layers},
  journal   = {Discrete {\&} Computational Geometry},
  volume    = {53},
  number    = {4},
  pages     = {675--690},
  year      = {2015},
  url       = {https://doi.org/10.1007/s00454-015-9672-3},
  doi       = {10.1007/s00454-015-9672-3},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dcg/AlvarezBCR15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/CurticapeanX15,
  author    = {Radu Curticapean and
               Mingji Xia},
  title     = {Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod
               2k},
  booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages     = {994--1009},
  year      = {2015},
  crossref  = {DBLP:conf/focs/2015},
  url       = {https://doi.org/10.1109/FOCS.2015.65},
  doi       = {10.1109/FOCS.2015.65},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/CurticapeanX15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/gi/Curticapean15,
  author    = {Radu Curticapean},
  title     = {Die einfachen, kleinen und langsamen Dinge z{\"{a}}hlen: {\"{U}}ber
               die parametrisierte Komplexit{\"{a}}t von Z{\"{a}}hlproblemen},
  booktitle = {Ausgezeichnete Informatikdissertationen 2015},
  pages     = {71--80},
  year      = {2015},
  crossref  = {DBLP:conf/gi/2015diss},
  timestamp = {Thu, 15 Dec 2016 19:13:23 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/gi/Curticapean15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Curticapean15,
  author    = {Radu Curticapean},
  title     = {Block Interpolation: {A} Framework for Tight Exponential-Time Counting
               Complexity},
  booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  pages     = {380--392},
  year      = {2015},
  crossref  = {DBLP:conf/icalp/2015-1},
  url       = {https://doi.org/10.1007/978-3-662-47672-7_31},
  doi       = {10.1007/978-3-662-47672-7_31},
  timestamp = {Tue, 23 May 2017 01:08:27 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/Curticapean15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanX15,
  author    = {Radu Curticapean and
               Mingji Xia},
  title     = {Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod
               2{\^{}}k},
  journal   = {CoRR},
  volume    = {abs/1511.02321},
  year      = {2015},
  url       = {http://arxiv.org/abs/1511.02321},
  archivePrefix = {arXiv},
  eprint    = {1511.02321},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/CurticapeanX15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Curticapean15,
  author    = {Radu Curticapean},
  title     = {Block Interpolation: {A} Framework for Tight Exponential-Time Counting
               Complexity},
  journal   = {CoRR},
  volume    = {abs/1511.02910},
  year      = {2015},
  url       = {http://arxiv.org/abs/1511.02910},
  archivePrefix = {arXiv},
  eprint    = {1511.02910},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Curticapean15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Curticapean15a,
  author    = {Radu Curticapean},
  title     = {Parity Separation: {A} Scientifically Proven Method for Permanent
               Weight Loss},
  journal   = {CoRR},
  volume    = {abs/1511.07480},
  year      = {2015},
  url       = {http://arxiv.org/abs/1511.07480},
  archivePrefix = {arXiv},
  eprint    = {1511.07480},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Curticapean15a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/CurticapeanM14,
  author    = {Radu Curticapean and
               D{\'{a}}niel Marx},
  title     = {Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover
               Number Counts},
  booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  pages     = {130--139},
  year      = {2014},
  crossref  = {DBLP:conf/focs/2014},
  url       = {https://doi.org/10.1109/FOCS.2014.22},
  doi       = {10.1109/FOCS.2014.22},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/CurticapeanM14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/Curticapean14,
  author    = {Radu Curticapean},
  title     = {Counting perfect matchings in graphs that exclude a single-crossing
               minor},
  journal   = {CoRR},
  volume    = {abs/1406.4056},
  year      = {2014},
  url       = {http://arxiv.org/abs/1406.4056},
  archivePrefix = {arXiv},
  eprint    = {1406.4056},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/Curticapean14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanM14,
  author    = {Radu Curticapean and
               D{\'{a}}niel Marx},
  title     = {Complexity of counting subgraphs: only the boundedness of the vertex-cover
               number counts},
  journal   = {CoRR},
  volume    = {abs/1407.2929},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.2929},
  archivePrefix = {arXiv},
  eprint    = {1407.2929},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/CurticapeanM14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/esa/CurticapeanK13,
  author    = {Radu Curticapean and
               Marvin K{\"{u}}nnemann},
  title     = {A Quantization Framework for Smoothed Analysis of Euclidean Optimization
               Problems},
  booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
               France, September 2-4, 2013. Proceedings},
  pages     = {349--360},
  year      = {2013},
  crossref  = {DBLP:conf/esa/2013},
  url       = {https://doi.org/10.1007/978-3-642-40450-4_30},
  doi       = {10.1007/978-3-642-40450-4_30},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/CurticapeanK13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Curticapean13,
  author    = {Radu Curticapean},
  title     = {Counting Matchings of Size k Is W[1]-Hard},
  booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
               {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
  pages     = {352--363},
  year      = {2013},
  crossref  = {DBLP:conf/icalp/2013-1},
  url       = {https://doi.org/10.1007/978-3-642-39206-1_30},
  doi       = {10.1007/978-3-642-39206-1_30},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/Curticapean13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CurticapeanK13,
  author    = {Radu Curticapean and
               Marvin K{\"{u}}nnemann},
  title     = {A quantization framework for smoothed analysis on Euclidean optimization
               problems},
  booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
               Enschede, Netherlands, May 21-23, 2013.},
  pages     = {71--74},
  year      = {2013},
  crossref  = {DBLP:conf/colognetwente/2013},
  timestamp = {Thu, 02 Feb 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/colognetwente/CurticapeanK13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/AlvarezBCR13,
  author    = {Victor Alvarez and
               Karl Bringmann and
               Radu Curticapean and
               Saurabh Ray},
  title     = {Counting Triangulations and other Crossing-free Structures via Onion
               Layers},
  journal   = {CoRR},
  volume    = {abs/1312.4628},
  year      = {2013},
  url       = {http://arxiv.org/abs/1312.4628},
  archivePrefix = {arXiv},
  eprint    = {1312.4628},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/AlvarezBCR13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AlvarezBCR12,
  author    = {Victor Alvarez and
               Karl Bringmann and
               Radu Curticapean and
               Saurabh Ray},
  title     = {Counting crossing-free structures},
  booktitle = {Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC,
               USA, June 17-20, 2012},
  pages     = {61--68},
  year      = {2012},
  crossref  = {DBLP:conf/compgeom/2012},
  url       = {http://doi.acm.org/10.1145/2261250.2261259},
  doi       = {10.1145/2261250.2261259},
  timestamp = {Fri, 30 Jan 2015 14:53:39 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/compgeom/AlvarezBCR12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BlaserC12,
  author    = {Markus Bl{\"{a}}ser and
               Radu Curticapean},
  title     = {Weighted Counting of k-Matchings Is {\#}W[1]-Hard},
  booktitle = {Parameterized and Exact Computation - 7th International Symposium,
               {IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
  pages     = {171--181},
  year      = {2012},
  crossref  = {DBLP:conf/iwpec/2012},
  url       = {https://doi.org/10.1007/978-3-642-33293-7_17},
  doi       = {10.1007/978-3-642-33293-7_17},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/iwpec/BlaserC12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BlaserC11,
  author    = {Markus Bl{\"{a}}ser and
               Radu Curticapean},
  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},
  pages     = {96--107},
  year      = {2011},
  crossref  = {DBLP:conf/mfcs/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    = {http://dblp.org/rec/bib/conf/mfcs/BlaserC11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2017,
  editor    = {Ioannis Chatzigiannakis and
               Piotr Indyk and
               Fabian Kuhn and
               Anca Muscholl},
  title     = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series    = {LIPIcs},
  volume    = {80},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-041-5},
  isbn      = {978-3-95977-041-5},
  timestamp = {Mon, 17 Jul 2017 16:47:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2017,
  editor    = {Heribert Vollmer and
               Brigitte Vall{\'{e}}e},
  title     = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2017, March 8-11, 2017, Hannover, Germany},
  series    = {LIPIcs},
  volume    = {66},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-028-6},
  isbn      = {978-3-95977-028-6},
  timestamp = {Mon, 20 Mar 2017 13:32:28 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2017,
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/esa/2016,
  editor    = {Piotr Sankowski and
               Christos D. Zaroliagis},
  title     = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
               2016, Aarhus, Denmark},
  series    = {LIPIcs},
  volume    = {57},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16013},
  isbn      = {978-3-95977-015-6},
  timestamp = {Tue, 30 Aug 2016 15:32:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2016,
  editor    = {Ioannis Chatzigiannakis and
               Michael Mitzenmacher and
               Yuval Rabani and
               Davide Sangiorgi},
  title     = {43rd International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  series    = {LIPIcs},
  volume    = {55},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-013-2},
  isbn      = {978-3-95977-013-2},
  timestamp = {Tue, 30 Aug 2016 15:33:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2016,
  editor    = {Robert Krauthgamer},
  title     = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974331},
  doi       = {10.1137/1.9781611974331},
  isbn      = {978-1-61197-433-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2015,
  editor    = {Venkatesan Guruswami},
  title     = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7352273},
  isbn      = {978-1-4673-8191-8},
  timestamp = {Mon, 04 Jan 2016 11:39:48 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/gi/2015diss,
  editor    = {Steffen H{\"{o}}lldobler},
  title     = {Ausgezeichnete Informatikdissertationen 2015},
  series    = {{LNI}},
  volume    = {{D-16}},
  publisher = {{GI}},
  year      = {2016},
  isbn      = {978-3-88579-975-7},
  timestamp = {Thu, 15 Dec 2016 19:13:23 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/gi/2015diss},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2015-1,
  editor    = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Kazuo Iwama and
               Naoki Kobayashi and
               Bettina Speckmann},
  title     = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9134},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-47672-7},
  doi       = {10.1007/978-3-662-47672-7},
  isbn      = {978-3-662-47671-0},
  timestamp = {Tue, 23 May 2017 01:08:27 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2015-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2014,
  title     = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6975722},
  isbn      = {978-1-4799-6517-5},
  timestamp = {Thu, 23 Jun 2016 15:53:28 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/esa/2013,
  editor    = {Hans L. Bodlaender and
               Giuseppe F. Italiano},
  title     = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
               France, September 2-4, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8125},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40450-4},
  doi       = {10.1007/978-3-642-40450-4},
  isbn      = {978-3-642-40449-8},
  timestamp = {Fri, 26 May 2017 00:49:36 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2013-1,
  editor    = {Fedor V. Fomin and
               Rusins Freivalds and
               Marta Z. Kwiatkowska and
               David Peleg},
  title     = {Automata, Languages, and Programming - 40th International Colloquium,
               {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {7965},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-39206-1},
  doi       = {10.1007/978-3-642-39206-1},
  isbn      = {978-3-642-39205-4},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2013-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/colognetwente/2013,
  editor    = {Kamiel Cornelissen and
               Ruben Hoeksma and
               Johann Hurink and
               Bodo Manthey},
  title     = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
               Enschede, Netherlands, May 21-23, 2013},
  series    = {{CTIT} Workshop Proceedings},
  volume    = {{WP} 13-01},
  year      = {2013},
  timestamp = {Thu, 16 May 2013 16:08:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/colognetwente/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2012,
  editor    = {Tamal K. Dey and
               Sue Whitesides},
  title     = {Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC,
               USA, June 17-20, 2012},
  publisher = {{ACM}},
  year      = {2012},
  url       = {http://doi.acm.org/10.1145/2261250},
  doi       = {10.1145/2261250},
  isbn      = {978-1-4503-1299-8},
  timestamp = {Fri, 30 Jan 2015 14:53:39 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/compgeom/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2012,
  editor    = {Dimitrios M. Thilikos and
               Gerhard J. Woeginger},
  title     = {Parameterized and Exact Computation - 7th International Symposium,
               {IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7535},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-33293-7},
  doi       = {10.1007/978-3-642-33293-7},
  isbn      = {978-3-642-33292-0},
  timestamp = {Fri, 26 May 2017 00:50:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/iwpec/2012},
  bibsource = {dblp computer science bibliography, http://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 = {Thu, 25 May 2017 00:43:01 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier