BibTeX records: Andrzej Lingas

download as .bib file

@article{DBLP:journals/dam/DannenbergJLL19,
  author    = {Katharina Dannenberg and
               Jesper Jansson and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {The approximability of maximum rooted triplets consistency with fan
               triplets and forbidden triplets},
  journal   = {Discrete Applied Mathematics},
  volume    = {257},
  pages     = {101--114},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.dam.2018.08.028},
  doi       = {10.1016/j.dam.2018.08.028},
  timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/DannenbergJLL19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KleinLSLL19,
  author    = {Rolf Klein and
               Elmar Langetepe and
               Barbara Schwarzwald and
               Christos Levcopoulos and
               Andrzej Lingas},
  title     = {On a Fire Fighter's Problem},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {30},
  number    = {2},
  pages     = {231--246},
  year      = {2019},
  url       = {https://doi.org/10.1142/S0129054119500023},
  doi       = {10.1142/S0129054119500023},
  timestamp = {Thu, 04 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijfcs/KleinLSLL19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DereniowskiLOPZ19,
  author    = {Dariusz Dereniowski and
               Andrzej Lingas and
               Dorota Osula and
               Mia Persson and
               Pawel Zylinski},
  title     = {Clearing directed subgraphs by mobile agents: Variations on covering
               with paths},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {102},
  pages     = {57--68},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.jcss.2018.11.002},
  doi       = {10.1016/j.jcss.2018.11.002},
  timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/DereniowskiLOPZ19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/GasieniecJLLP19,
  author    = {Leszek Gasieniec and
               Jesper Jansson and
               Christos Levcopoulos and
               Andrzej Lingas and
               Mia Persson},
  title     = {Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying
               Its Easy Cases},
  booktitle = {Frontiers in Algorithmics - 13th International Workshop, {FAW} 2019,
               Sanya, China, April 29 - May 3, 2019, Proceedings},
  pages     = {156--169},
  year      = {2019},
  crossref  = {DBLP:conf/faw/2019},
  url       = {https://doi.org/10.1007/978-3-030-18126-0\_14},
  doi       = {10.1007/978-3-030-18126-0\_14},
  timestamp = {Thu, 18 Apr 2019 17:11:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/faw/GasieniecJLLP19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JuknaL19,
  author    = {Stasys Jukna and
               Andrzej Lingas},
  title     = {Lower Bounds for DeMorgan Circuits of Bounded Negation Width},
  booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
               {STACS} 2019, March 13-16, 2019, Berlin, Germany},
  pages     = {41:1--41:17},
  year      = {2019},
  crossref  = {DBLP:conf/stacs/2019},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2019.41},
  doi       = {10.4230/LIPIcs.STACS.2019.41},
  timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/JuknaL19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FloderusJLLS18,
  author    = {Peter Floderus and
               Jesper Jansson and
               Christos Levcopoulos and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {3D Rectangulations and Geometric Matrix Multiplication},
  journal   = {Algorithmica},
  volume    = {80},
  number    = {1},
  pages     = {136--154},
  year      = {2018},
  url       = {https://doi.org/10.1007/s00453-016-0247-3},
  doi       = {10.1007/s00453-016-0247-3},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/FloderusJLLS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LingasP18,
  author    = {Andrzej Lingas and
               Mia Persson},
  title     = {Extreme Witnesses and Their Applications},
  journal   = {Algorithmica},
  volume    = {80},
  number    = {12},
  pages     = {3943--3957},
  year      = {2018},
  url       = {https://doi.org/10.1007/s00453-018-0492-8},
  doi       = {10.1007/s00453-018-0492-8},
  timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/LingasP18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/KleinLL18,
  author    = {Rolf Klein and
               Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Approximation Algorithms for the Geometric Firefighter and Budget
               Fence Problems},
  journal   = {Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {45},
  year      = {2018},
  url       = {https://doi.org/10.3390/a11040045},
  doi       = {10.3390/a11040045},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/algorithms/KleinLL18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BohlerKLL18,
  author    = {Cecilia Bohler and
               Rolf Klein and
               Andrzej Lingas and
               Chih{-}Hung Liu},
  title     = {Forest-like abstract Voronoi diagrams in linear time},
  journal   = {Comput. Geom.},
  volume    = {68},
  pages     = {134--145},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.comgeo.2017.06.013},
  doi       = {10.1016/j.comgeo.2017.06.013},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/BohlerKLL18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KowalukL18,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {Are unique subgraphs not easier to find?},
  journal   = {Inf. Process. Lett.},
  volume    = {134},
  pages     = {57--61},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2018.02.010},
  doi       = {10.1016/j.ipl.2018.02.010},
  timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/KowalukL18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AdamaszekCLW18,
  author    = {Anna Adamaszek and
               Artur Czumaj and
               Andrzej Lingas and
               Jakub Onufry Wojtaszczyk},
  title     = {Approximation Schemes for Capacitated Geometric Network Design},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {32},
  number    = {4},
  pages     = {2720--2746},
  year      = {2018},
  url       = {https://doi.org/10.1137/16M1108005},
  doi       = {10.1137/16M1108005},
  timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/AdamaszekCLW18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KarpinskiLS18,
  author    = {Marek Karpinski and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {A {QPTAS} for the base of the number of crossing-free structures on
               a planar point set},
  journal   = {Theor. Comput. Sci.},
  volume    = {711},
  pages     = {56--65},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.tcs.2017.11.003},
  doi       = {10.1016/j.tcs.2017.11.003},
  timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/KarpinskiLS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Lingas18,
  author    = {Andrzej Lingas},
  title     = {Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms
               Require Logarithmic Conjunction-depth},
  booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
               2018, San Diego, CA, {USA}},
  pages     = {26:1--26:10},
  year      = {2018},
  crossref  = {DBLP:conf/coco/2018},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2018.26},
  doi       = {10.4230/LIPIcs.CCC.2018.26},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/Lingas18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Lingas18,
  author    = {Andrzej Lingas},
  title     = {Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms
               Require Logarithmic Conjunction-depth},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {108},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/108},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Lingas18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JuknaL18,
  author    = {Stasys Jukna and
               Andrzej Lingas},
  title     = {Lower Bounds for Circuits of Bounded Negation Width},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {154},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/154},
  timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/JuknaL18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GasieniecLLPT17,
  author    = {Leszek Gasieniec and
               Christos Levcopoulos and
               Andrzej Lingas and
               Rasmus Pagh and
               Takeshi Tokuyama},
  title     = {Efficiently Correcting Matrix Products},
  journal   = {Algorithmica},
  volume    = {79},
  number    = {2},
  pages     = {428--443},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00453-016-0202-3},
  doi       = {10.1007/s00453-016-0202-3},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/GasieniecLLPT17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/DereniowskiLPUZ17,
  author    = {Dariusz Dereniowski and
               Andrzej Lingas and
               Mia Persson and
               Dorota Urbanska and
               Pawel Zylinski},
  title     = {The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents)},
  booktitle = {Fundamentals of Computation Theory - 21st International Symposium,
               {FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
  pages     = {190--203},
  year      = {2017},
  crossref  = {DBLP:conf/fct/2017},
  url       = {https://doi.org/10.1007/978-3-662-55751-8\_16},
  doi       = {10.1007/978-3-662-55751-8\_16},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/fct/DereniowskiLPUZ17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/JanssonLRS17,
  author    = {Jesper Jansson and
               Andrzej Lingas and
               Ramesh Rajaby and
               Wing{-}Kin Sung},
  title     = {Determining the Consistency of Resolved Triplets and Fan Triplets},
  booktitle = {Research in Computational Molecular Biology - 21st Annual International
               Conference, {RECOMB} 2017, Hong Kong, China, May 3-7, 2017, Proceedings},
  pages     = {82--98},
  year      = {2017},
  crossref  = {DBLP:conf/recomb/2017},
  url       = {https://doi.org/10.1007/978-3-319-56970-3\_6},
  doi       = {10.1007/978-3-319-56970-3\_6},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/recomb/JanssonLRS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GasieniecKLLMR17,
  author    = {Leszek Gasieniec and
               Ralf Klasing and
               Christos Levcopoulos and
               Andrzej Lingas and
               Jie Min and
               Tomasz Radzik},
  title     = {Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines
               with Different Attendance Urgency Factors)},
  booktitle = {{SOFSEM} 2017: Theory and Practice of Computer Science - 43rd International
               Conference on Current Trends in Theory and Practice of Computer Science,
               Limerick, Ireland, January 16-20, 2017, Proceedings},
  pages     = {229--240},
  year      = {2017},
  crossref  = {DBLP:conf/sofsem/2017},
  url       = {https://doi.org/10.1007/978-3-319-51963-0\_18},
  doi       = {10.1007/978-3-319-51963-0\_18},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sofsem/GasieniecKLLMR17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Lingas17,
  author    = {Andrzej Lingas},
  title     = {Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity
               of the Boolean Convolution},
  booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference,
               {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
  pages     = {401--411},
  year      = {2017},
  crossref  = {DBLP:conf/tamc/2017},
  url       = {https://doi.org/10.1007/978-3-319-55911-7\_29},
  doi       = {10.1007/978-3-319-55911-7\_29},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/Lingas17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/LingasPS17,
  author    = {Andrzej Lingas and
               Mia Persson and
               Dzmitry Sledneu},
  title     = {Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational
               Model},
  booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference,
               {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
  pages     = {412--424},
  year      = {2017},
  crossref  = {DBLP:conf/tamc/2017},
  url       = {https://doi.org/10.1007/978-3-319-55911-7\_30},
  doi       = {10.1007/978-3-319-55911-7\_30},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/LingasPS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/KowalukL17,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without
               Large Cliques},
  booktitle = {{WALCOM:} Algorithms and Computation, 11th International Conference
               and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017,
               Proceedings.},
  pages     = {217--227},
  year      = {2017},
  crossref  = {DBLP:conf/walcom/2017},
  url       = {https://doi.org/10.1007/978-3-319-53925-6\_17},
  doi       = {10.1007/978-3-319-53925-6\_17},
  timestamp = {Tue, 23 May 2017 01:12:09 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/walcom/KowalukL17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-00316,
  author    = {Dariusz Dereniowski and
               Andrzej Lingas and
               Dorota Osula and
               Mia Persson and
               Pawel Zylinski},
  title     = {The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)},
  journal   = {CoRR},
  volume    = {abs/1712.00316},
  year      = {2017},
  url       = {http://arxiv.org/abs/1712.00316},
  archivePrefix = {arXiv},
  eprint    = {1712.00316},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1712-00316},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/CzumajL16,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Minimum \emph{k}-Connected Geometric Networks},
  booktitle = {Encyclopedia of Algorithms},
  pages     = {1318--1322},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-1-4939-2864-4\_237},
  doi       = {10.1007/978-1-4939-2864-4\_237},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/reference/algo/CzumajL16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GasieniecLLPT16,
  author    = {Leszek Gasieniec and
               Christos Levcopoulos and
               Andrzej Lingas and
               Rasmus Pagh and
               Takeshi Tokuyama},
  title     = {Efficiently Correcting Matrix Products},
  journal   = {CoRR},
  volume    = {abs/1602.00435},
  year      = {2016},
  url       = {http://arxiv.org/abs/1602.00435},
  archivePrefix = {arXiv},
  eprint    = {1602.00435},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GasieniecLLPT16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LingasP15,
  author    = {Andrzej Lingas and
               Mia Persson},
  title     = {A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows},
  journal   = {Algorithmica},
  volume    = {72},
  number    = {2},
  pages     = {607--619},
  year      = {2015},
  url       = {https://doi.org/10.1007/s00453-013-9865-1},
  doi       = {10.1007/s00453-013-9865-1},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/LingasP15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FloderusLPS15,
  author    = {Peter Floderus and
               Andrzej Lingas and
               Mia Persson and
               Dzmitry Sledneu},
  title     = {Detecting monomials with k distinct variables},
  journal   = {Inf. Process. Lett.},
  volume    = {115},
  number    = {2},
  pages     = {82--86},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.ipl.2014.07.003},
  doi       = {10.1016/j.ipl.2014.07.003},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/FloderusLPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FloderusKLL15,
  author    = {Peter Floderus and
               Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Detecting and Counting Small Pattern Graphs},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {29},
  number    = {3},
  pages     = {1322--1339},
  year      = {2015},
  url       = {https://doi.org/10.1137/140978211},
  doi       = {10.1137/140978211},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/FloderusKLL15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FloderusKLL15,
  author    = {Peter Floderus and
               Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Induced subgraph isomorphism: Are some patterns substantially easier
               than others?},
  journal   = {Theor. Comput. Sci.},
  volume    = {605},
  pages     = {119--128},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.tcs.2015.09.001},
  doi       = {10.1016/j.tcs.2015.09.001},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/FloderusKLL15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LingasP15,
  author    = {Andrzej Lingas and
               Mia Persson},
  title     = {Extreme Witnesses and Their Applications},
  booktitle = {Combinatorial Optimization and Applications - 9th International Conference,
               {COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
  pages     = {452--466},
  year      = {2015},
  crossref  = {DBLP:conf/cocoa/2015},
  url       = {https://doi.org/10.1007/978-3-319-26626-8\_33},
  doi       = {10.1007/978-3-319-26626-8\_33},
  timestamp = {Wed, 17 May 2017 14:24:37 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoa/LingasP15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/JanssonLL15,
  author    = {Jesper Jansson and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {The Approximability of Maximum Rooted Triplets Consistency with Fan
               Triplets and Forbidden Triplets},
  booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
               Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
  pages     = {272--283},
  year      = {2015},
  crossref  = {DBLP:conf/cpm/2015},
  url       = {https://doi.org/10.1007/978-3-319-19929-0\_23},
  doi       = {10.1007/978-3-319-19929-0\_23},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/JanssonLL15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KarpinskiLS15,
  author    = {Marek Karpinski and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {A {QPTAS} for the Base of the Number of Crossing-Free Structures on
               a Planar Point Set},
  booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  pages     = {785--796},
  year      = {2015},
  crossref  = {DBLP:conf/icalp/2015-1},
  url       = {https://doi.org/10.1007/978-3-662-47672-7\_64},
  doi       = {10.1007/978-3-662-47672-7\_64},
  timestamp = {Fri, 02 Nov 2018 09:50:27 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/KarpinskiLS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/ZechnerL14,
  author    = {Niklas Zechner and
               Andrzej Lingas},
  title     = {Efficient Algorithms for Subgraph Listing},
  journal   = {Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {243--252},
  year      = {2014},
  url       = {https://doi.org/10.3390/a7020243},
  doi       = {10.3390/a7020243},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithms/ZechnerL14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijmheur/LingasPS14,
  author    = {Andrzej Lingas and
               Mia Persson and
               Dzmitry Sledneu},
  title     = {Iterative merging heuristics for correlation clustering},
  journal   = {IJMHeur},
  volume    = {3},
  number    = {2},
  pages     = {105--117},
  year      = {2014},
  url       = {https://doi.org/10.1504/IJMHEUR.2014.063141},
  doi       = {10.1504/IJMHEUR.2014.063141},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijmheur/LingasPS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LevcopoulosL14,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {A note on a {QPTAS} for maximum weight triangulation of planar point
               sets},
  journal   = {Inf. Process. Lett.},
  volume    = {114},
  number    = {8},
  pages     = {414--416},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.ipl.2014.03.002},
  doi       = {10.1016/j.ipl.2014.03.002},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/LevcopoulosL14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LingasPWZ14,
  author    = {Andrzej Lingas and
               Leonidas Palios and
               Agnieszka Wasylewicz and
               Pawel Zylinski},
  title     = {Corrigendum to "Note on covering monotone orthogonal polygons"
               [Inf. Process. Lett. 104(6) {(2007)} 220-227]},
  journal   = {Inf. Process. Lett.},
  volume    = {114},
  number    = {11},
  pages     = {646--654},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.ipl.2014.03.016},
  doi       = {10.1016/j.ipl.2014.03.016},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/LingasPWZ14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JanssonL14,
  author    = {Jesper Jansson and
               Andrzej Lingas},
  title     = {Computing the rooted triplet distance between galled trees by counting
               triangles},
  journal   = {J. Discrete Algorithms},
  volume    = {25},
  pages     = {66--78},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.jda.2013.10.002},
  doi       = {10.1016/j.jda.2013.10.002},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jda/JanssonL14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/LevcopoulosLNZ14,
  author    = {Christos Levcopoulos and
               Andrzej Lingas and
               Bengt J. Nilsson and
               Pawel Zylinski},
  title     = {Clearing Connections by Few Agents},
  booktitle = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari
               Island, Sicily, Italy, July 1-3, 2014. Proceedings},
  pages     = {289--300},
  year      = {2014},
  crossref  = {DBLP:conf/fun/2014},
  url       = {https://doi.org/10.1007/978-3-319-07890-8\_25},
  doi       = {10.1007/978-3-319-07890-8\_25},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/fun/LevcopoulosLNZ14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GasieniecLL14,
  author    = {Leszek Gasieniec and
               Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Efficiently Correcting Matrix Products},
  booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
               2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
  pages     = {53--64},
  year      = {2014},
  crossref  = {DBLP:conf/isaac/2014},
  url       = {https://doi.org/10.1007/978-3-319-13075-0\_5},
  doi       = {10.1007/978-3-319-13075-0\_5},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/GasieniecLL14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FloderusJLLS14,
  author    = {Peter Floderus and
               Jesper Jansson and
               Christos Levcopoulos and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {3D Rectangulations and Geometric Matrix Multiplication},
  booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
               2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
  pages     = {65--78},
  year      = {2014},
  crossref  = {DBLP:conf/isaac/2014},
  url       = {https://doi.org/10.1007/978-3-319-13075-0\_6},
  doi       = {10.1007/978-3-319-13075-0\_6},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/FloderusJLLS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/KleinLL14,
  author    = {Rolf Klein and
               Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Approximation Algorithms for the Geometric Firefighter and Budget
               Fence Problems},
  booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
               Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
  pages     = {261--272},
  year      = {2014},
  crossref  = {DBLP:conf/latin/2014},
  url       = {https://doi.org/10.1007/978-3-642-54423-1\_23},
  doi       = {10.1007/978-3-642-54423-1\_23},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/latin/KleinLL14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KarpinskiLS14,
  author    = {Marek Karpinski and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {A {QPTAS} for the Base of the Number of Triangulations of a Planar
               Point Set},
  journal   = {CoRR},
  volume    = {abs/1411.0544},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.0544},
  archivePrefix = {arXiv},
  eprint    = {1411.0544},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/KarpinskiLS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Lingas14,
  author    = {Andrzej Lingas},
  title     = {Vector convolution in O(n) steps and matrix multiplication in O(n{\^{}}2)
               steps : -)},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {39},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/039},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Lingas14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/GalcikGL13,
  author    = {Frantisek Galc{\'{\i}}k and
               Leszek Gasieniec and
               Andrzej Lingas},
  title     = {Efficient broadcasting in radio networks with long-range interference},
  journal   = {Distributed Computing},
  volume    = {26},
  number    = {1},
  pages     = {59--74},
  year      = {2013},
  url       = {https://doi.org/10.1007/s00446-012-0176-6},
  doi       = {10.1007/s00446-012-0176-6},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dc/GalcikGL13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/KowalukLL13,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Unique subgraphs are not easier to find},
  journal   = {Int. J. Comput. Math.},
  volume    = {90},
  number    = {6},
  pages     = {1247--1253},
  year      = {2013},
  url       = {https://doi.org/10.1080/00207160.2012.701287},
  doi       = {10.1080/00207160.2012.701287},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcm/KowalukLL13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FloderusLP13,
  author    = {Peter Floderus and
               Andrzej Lingas and
               Mia Persson},
  title     = {Towards More Efficient Infection and Fire Fighting},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {24},
  number    = {1},
  pages     = {3--14},
  year      = {2013},
  url       = {https://doi.org/10.1142/S0129054113400017},
  doi       = {10.1142/S0129054113400017},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijfcs/FloderusLP13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarpinskiLS13,
  author    = {Marek Karpinski and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {Optimal cuts and partitions in tree metrics in polynomial time},
  journal   = {Inf. Process. Lett.},
  volume    = {113},
  number    = {12},
  pages     = {447--451},
  year      = {2013},
  url       = {https://doi.org/10.1016/j.ipl.2013.03.009},
  doi       = {10.1016/j.ipl.2013.03.009},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/KarpinskiLS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KowalukLL13,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Counting and Detecting Small Subgraphs via Equations},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {27},
  number    = {2},
  pages     = {892--909},
  year      = {2013},
  url       = {https://doi.org/10.1137/110859798},
  doi       = {10.1137/110859798},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/KowalukLL13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FloderusKLL13,
  author    = {Peter Floderus and
               Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Detecting and Counting Small Pattern Graphs},
  booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
               2013, Hong Kong, China, December 16-18, 2013, Proceedings},
  pages     = {547--557},
  year      = {2013},
  crossref  = {DBLP:conf/isaac/2013},
  url       = {https://doi.org/10.1007/978-3-642-45030-3\_51},
  doi       = {10.1007/978-3-642-45030-3\_51},
  timestamp = {Wed, 14 Nov 2018 10:57:25 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/FloderusKLL13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lssc/LingasP13,
  author    = {Andrzej Lingas and
               Mia Persson},
  title     = {Simple Iterative Heuristics for Correlation Clustering},
  booktitle = {Large-Scale Scientific Computing - 9th International Conference, {LSSC}
               2013, Sozopol, Bulgaria, June 3-7, 2013. Revised Selected Papers},
  pages     = {264--271},
  year      = {2013},
  crossref  = {DBLP:conf/lssc/2013},
  url       = {https://doi.org/10.1007/978-3-662-43880-0\_29},
  doi       = {10.1007/978-3-662-43880-0\_29},
  timestamp = {Sun, 04 Jun 2017 10:07:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lssc/LingasP13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FloderusLPS13,
  author    = {Peter Floderus and
               Andrzej Lingas and
               Mia Persson and
               Dzmitry Sledneu},
  title     = {Detecting Monomials with k Distinct Variables},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {139},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/139},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/FloderusLPS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanKL12,
  author    = {Piotr Berman and
               Marek Karpinski and
               Andrzej Lingas},
  title     = {Exact and Approximation Algorithms for Geometric and Capacitated Set
               Cover Problems},
  journal   = {Algorithmica},
  volume    = {64},
  number    = {2},
  pages     = {295--310},
  year      = {2012},
  url       = {https://doi.org/10.1007/s00453-011-9591-5},
  doi       = {10.1007/s00453-011-9591-5},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/BermanKL12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/LingasWZ12,
  author    = {Andrzej Lingas and
               Agnieszka Wasylewicz and
               Pawel Zylinski},
  title     = {Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {22},
  number    = {2},
  pages     = {103--142},
  year      = {2012},
  url       = {https://doi.org/10.1142/S021819591250001X},
  doi       = {10.1142/S021819591250001X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/LingasWZ12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JanssonLL12,
  author    = {Jesper Jansson and
               Richard S. Lemence and
               Andrzej Lingas},
  title     = {The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {272--291},
  year      = {2012},
  url       = {https://doi.org/10.1137/100811489},
  doi       = {10.1137/100811489},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/JanssonLL12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FloderusKLL12,
  author    = {Peter Floderus and
               Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier
               Than Others?},
  booktitle = {Computing and Combinatorics - 18th Annual International Conference,
               {COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
  pages     = {37--48},
  year      = {2012},
  crossref  = {DBLP:conf/cocoon/2012},
  url       = {https://doi.org/10.1007/978-3-642-32241-9\_4},
  doi       = {10.1007/978-3-642-32241-9\_4},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/FloderusKLL12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/JanssonL12,
  author    = {Jesper Jansson and
               Andrzej Lingas},
  title     = {Computing the Rooted Triplet Distance between Galled Trees by Counting
               Triangles},
  booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
               Helsinki, Finland, July 3-5, 2012. Proceedings},
  pages     = {385--398},
  year      = {2012},
  crossref  = {DBLP:conf/cpm/2012},
  url       = {https://doi.org/10.1007/978-3-642-31265-6\_31},
  doi       = {10.1007/978-3-642-31265-6\_31},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/JanssonL12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/LingasP12,
  author    = {Andrzej Lingas and
               Mia Persson},
  title     = {A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows},
  booktitle = {Euro-Par 2012 Parallel Processing - 18th International Conference,
               Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings},
  pages     = {688--699},
  year      = {2012},
  crossref  = {DBLP:conf/europar/2012},
  url       = {https://doi.org/10.1007/978-3-642-32820-6\_68},
  doi       = {10.1007/978-3-642-32820-6\_68},
  timestamp = {Wed, 24 May 2017 08:27:49 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/europar/LingasP12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/LingasS12,
  author    = {Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed
               Vertex-Weighted Graphs with Applications to Disc Graphs},
  booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
               on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
               Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings},
  pages     = {373--384},
  year      = {2012},
  crossref  = {DBLP:conf/sofsem/2012},
  url       = {https://doi.org/10.1007/978-3-642-27660-6\_31},
  doi       = {10.1007/978-3-642-27660-6\_31},
  timestamp = {Tue, 23 May 2017 01:08:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sofsem/LingasS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0933,
  author    = {Marek Karpinski and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {Optimal Cuts and Bisections on the Real Line in Polynomial Time},
  journal   = {CoRR},
  volume    = {abs/1207.0933},
  year      = {2012},
  url       = {http://arxiv.org/abs/1207.0933},
  archivePrefix = {arXiv},
  eprint    = {1207.0933},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1207-0933},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-0340,
  author    = {Andrzej Lingas and
               Mia Persson},
  title     = {A fast parallel algorithm for minimum-cost small integral flows},
  journal   = {CoRR},
  volume    = {abs/1210.0340},
  year      = {2012},
  url       = {http://arxiv.org/abs/1210.0340},
  archivePrefix = {arXiv},
  eprint    = {1210.0340},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1210-0340},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-3471,
  author    = {Marek Karpinski and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {Optimal Cuts and Partitions in Tree Metrics in Polynomial Time},
  journal   = {CoRR},
  volume    = {abs/1212.3471},
  year      = {2012},
  url       = {http://arxiv.org/abs/1212.3471},
  archivePrefix = {arXiv},
  eprint    = {1212.3471},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1212-3471},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KarpinskiLS12,
  author    = {Marek Karpinski and
               Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {Optimal Cuts and Partitions in Tree Metrics in Polynomial Time},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {176},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/176},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/KarpinskiLS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Lingas11,
  author    = {Andrzej Lingas},
  title     = {A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication},
  journal   = {Algorithmica},
  volume    = {61},
  number    = {1},
  pages     = {36--50},
  year      = {2011},
  url       = {https://doi.org/10.1007/s00453-010-9441-x},
  doi       = {10.1007/s00453-010-9441-x},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/Lingas11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CzumajCGJLZ11,
  author    = {Artur Czumaj and
               Jurek Czyzowicz and
               Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas and
               Pawel Zylinski},
  title     = {Approximation Algorithms for Buy-at-Bulk Geometric Network Design},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {22},
  number    = {8},
  pages     = {1949--1969},
  year      = {2011},
  url       = {https://doi.org/10.1142/S0129054111009148},
  doi       = {10.1142/S0129054111009148},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijfcs/CzumajCGJLZ11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/FloderusLP11,
  author    = {Peter Floderus and
               Andrzej Lingas and
               Mia Persson},
  title     = {Towards More Efficient Infection and Fire Fighting},
  booktitle = {Seventeenth Computing: The Australasian Theory Symposium, {CATS} 2011,
               Perth, Australia, January 2011},
  pages     = {69--74},
  year      = {2011},
  crossref  = {DBLP:conf/cats/2011},
  url       = {http://crpit.com/abstracts/CRPITV119Floderus.html},
  timestamp = {Wed, 17 Apr 2013 21:02:40 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cats/FloderusLP11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdamaszekCLW11,
  author    = {Anna Adamaszek and
               Artur Czumaj and
               Andrzej Lingas and
               Jakub Onufry Wojtaszczyk},
  title     = {Approximation Schemes for Capacitated Geometric Network Design},
  booktitle = {Automata, Languages and Programming - 38th International Colloquium,
               {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
               {I}},
  pages     = {25--36},
  year      = {2011},
  crossref  = {DBLP:conf/icalp/2011-1},
  url       = {https://doi.org/10.1007/978-3-642-22006-7\_3},
  doi       = {10.1007/978-3-642-22006-7\_3},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/AdamaszekCLW11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/KowalukLL11,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Unique Small Subgraphs Are Not Easier to Find},
  booktitle = {Language and Automata Theory and Applications - 5th International
               Conference, {LATA} 2011, Tarragona, Spain, May 26-31, 2011. Proceedings},
  pages     = {336--341},
  year      = {2011},
  crossref  = {DBLP:conf/lata/2011},
  url       = {https://doi.org/10.1007/978-3-642-21254-3\_26},
  doi       = {10.1007/978-3-642-21254-3\_26},
  timestamp = {Wed, 24 May 2017 08:29:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lata/KowalukLL11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KowalukLL11,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Counting and detecting small subgraphs via equations and matrix multiplication},
  booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  pages     = {1468--1476},
  year      = {2011},
  crossref  = {DBLP:conf/soda/2011},
  url       = {https://doi.org/10.1137/1.9781611973082.114},
  doi       = {10.1137/1.9781611973082.114},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/KowalukLL11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/LingasD11,
  author    = {Andrzej Lingas and
               Cui Di},
  title     = {Near Approximation of Maximum Weight Matching through Efficient Weight
               Reduction},
  booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
               {TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
  pages     = {48--57},
  year      = {2011},
  crossref  = {DBLP:conf/tamc/2011},
  url       = {https://doi.org/10.1007/978-3-642-20877-5\_6},
  doi       = {10.1007/978-3-642-20877-5\_6},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/LingasD11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1235,
  author    = {Ajit A. Diwan and
               Subir Kumar Ghosh and
               Partha P. Goswami and
               Andrzej Lingas},
  title     = {On joint triangulations of two sets of points in the plane},
  journal   = {CoRR},
  volume    = {abs/1102.1235},
  year      = {2011},
  url       = {http://arxiv.org/abs/1102.1235},
  archivePrefix = {arXiv},
  eprint    = {1102.1235},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1102-1235},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-6519,
  author    = {Andrzej Lingas and
               Dzmitry Sledneu},
  title     = {A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed
               Vertex-Weighted Graphs with Applications to Disc Graphs},
  journal   = {CoRR},
  volume    = {abs/1111.6519},
  year      = {2011},
  url       = {http://arxiv.org/abs/1111.6519},
  archivePrefix = {arXiv},
  eprint    = {1111.6519},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1111-6519},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AdamaszekCL10,
  author    = {Anna Adamaszek and
               Artur Czumaj and
               Andrzej Lingas},
  title     = {Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values
               of k},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {21},
  number    = {6},
  pages     = {893--904},
  year      = {2010},
  url       = {https://doi.org/10.1142/S0129054110007623},
  doi       = {10.1142/S0129054110007623},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ijfcs/AdamaszekCL10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BermanKL10,
  author    = {Piotr Berman and
               Marek Karpinski and
               Andrzej Lingas},
  title     = {Exact and Approximation Algorithms for Geometric and Capacitated Set
               Cover Problems},
  booktitle = {Computing and Combinatorics, 16th Annual International Conference,
               {COCOON} 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
  pages     = {226--234},
  year      = {2010},
  crossref  = {DBLP:conf/cocoon/2010},
  url       = {https://doi.org/10.1007/978-3-642-14031-0\_26},
  doi       = {10.1007/978-3-642-14031-0\_26},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/BermanKL10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/AntoniadisL10,
  author    = {Antonios Antoniadis and
               Andrzej Lingas},
  title     = {Approximability of Edge Matching Puzzles},
  booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
               on Current Trends in Theory and Practice of Computer Science, Spindleruv
               Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
  pages     = {153--164},
  year      = {2010},
  crossref  = {DBLP:conf/sofsem/2010},
  url       = {https://doi.org/10.1007/978-3-642-11266-9\_13},
  doi       = {10.1007/978-3-642-11266-9\_13},
  timestamp = {Tue, 23 May 2017 01:08:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sofsem/AntoniadisL10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/JanssonLL10,
  author    = {Jesper Jansson and
               Richard S. Lemence and
               Andrzej Lingas},
  title     = {The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree},
  booktitle = {Algorithms in Bioinformatics, 10th International Workshop, {WABI}
               2010, Liverpool, UK, September 6-8, 2010. Proceedings},
  pages     = {262--273},
  year      = {2010},
  crossref  = {DBLP:conf/wabi/2010},
  url       = {https://doi.org/10.1007/978-3-642-15294-8\_22},
  doi       = {10.1007/978-3-642-15294-8\_22},
  timestamp = {Tue, 30 Oct 2018 10:59:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/wabi/JanssonLL10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-5911,
  author    = {Cui Di and
               Andrzej Lingas},
  title     = {Near approximation of maximum weight matching through efficient weight
               reduction},
  journal   = {CoRR},
  volume    = {abs/1012.5911},
  year      = {2010},
  url       = {http://arxiv.org/abs/1012.5911},
  archivePrefix = {arXiv},
  eprint    = {1012.5911},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1012-5911},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GasieniecKL09,
  author    = {Leszek Gasieniec and
               Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {Faster multi-witnesses for Boolean matrix multiplication},
  journal   = {Inf. Process. Lett.},
  volume    = {109},
  number    = {4},
  pages     = {242--247},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.ipl.2008.10.012},
  doi       = {10.1016/j.ipl.2008.10.012},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/GasieniecKL09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LingasL09,
  author    = {Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Efficient approximation algorithms for shortest cycles in undirected
               graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {109},
  number    = {10},
  pages     = {493--498},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.ipl.2009.01.008},
  doi       = {10.1016/j.ipl.2009.01.008},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/LingasL09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LingasW09,
  author    = {Andrzej Lingas and
               Martin Wahlen},
  title     = {An exact algorithm for subgraph homeomorphism},
  journal   = {J. Discrete Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {464--468},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.jda.2008.10.003},
  doi       = {10.1016/j.jda.2008.10.003},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jda/LingasW09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajL09,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix
               Multiplication},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {431--444},
  year      = {2009},
  url       = {https://doi.org/10.1137/070695149},
  doi       = {10.1137/070695149},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/CzumajL09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Lingas09,
  author    = {Andrzej Lingas},
  title     = {A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication},
  booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
               Denmark, September 7-9, 2009. Proceedings},
  pages     = {408--419},
  year      = {2009},
  crossref  = {DBLP:conf/esa/2009},
  url       = {https://doi.org/10.1007/978-3-642-04128-0\_37},
  doi       = {10.1007/978-3-642-04128-0\_37},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/Lingas09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AdamaszekCL09,
  author    = {Anna Adamaszek and
               Artur Czumaj and
               Andrzej Lingas},
  title     = {{PTAS} for \emph{k}-Tour Cover Problem on the Plane for Moderately
               Large Values of \emph{k}},
  booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
               2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  pages     = {994--1003},
  year      = {2009},
  crossref  = {DBLP:conf/isaac/2009},
  url       = {https://doi.org/10.1007/978-3-642-10631-6\_100},
  doi       = {10.1007/978-3-642-10631-6\_100},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/AdamaszekCL09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GalcikGL09,
  author    = {Frantisek Galc{\'{\i}}k and
               Leszek Gasieniec and
               Andrzej Lingas},
  title     = {Efficient broadcasting in known topology radio networks with long-range
               interference},
  booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed
               Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009},
  pages     = {230--239},
  year      = {2009},
  crossref  = {DBLP:conf/podc/2009},
  url       = {https://doi.org/10.1145/1582716.1582754},
  doi       = {10.1145/1582716.1582754},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/podc/GalcikGL09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CzumajCGJLZ09,
  author    = {Artur Czumaj and
               Jurek Czyzowicz and
               Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas and
               Pawel Zylinski},
  title     = {Approximation Algorithms for Buy-at-Bulk Geometric Network Design},
  booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
               2009, Banff, Canada, August 21-23, 2009. Proceedings},
  pages     = {168--180},
  year      = {2009},
  crossref  = {DBLP:conf/wads/2009},
  url       = {https://doi.org/10.1007/978-3-642-03367-4\_15},
  doi       = {10.1007/978-3-642-03367-4\_15},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/CzumajCGJLZ09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-2310,
  author    = {Piotr Berman and
               Marek Karpinski and
               Andrzej Lingas},
  title     = {Exact and Approximation Algorithms for Geometric and Capacitated Set
               Cover Problems with Applications},
  journal   = {CoRR},
  volume    = {abs/0904.2310},
  year      = {2009},
  url       = {http://arxiv.org/abs/0904.2310},
  archivePrefix = {arXiv},
  eprint    = {0904.2310},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0904-2310},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-2576,
  author    = {Anna Adamaszek and
               Artur Czumaj and
               Andrzej Lingas},
  title     = {{PTAS} for k-tour cover problem on the plane for moderately large
               values of k},
  journal   = {CoRR},
  volume    = {abs/0904.2576},
  year      = {2009},
  url       = {http://arxiv.org/abs/0904.2576},
  archivePrefix = {arXiv},
  eprint    = {0904.2576},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0904-2576},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IwamaLO08,
  author    = {Kazuo Iwama and
               Andrzej Lingas and
               Masaki Okita},
  title     = {Max-Stretch Reduction for Tree Spanners},
  journal   = {Algorithmica},
  volume    = {50},
  number    = {2},
  pages     = {223--235},
  year      = {2008},
  url       = {https://doi.org/10.1007/s00453-007-9058-x},
  doi       = {10.1007/s00453-007-9058-x},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/IwamaLO08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FigueroaGJKLP08,
  author    = {Andres Figueroa and
               Avraham Goldstein and
               Tao Jiang and
               Maciej Kurowski and
               Andrzej Lingas and
               Mia Persson},
  title     = {Approximate clustering of incomplete fingerprints},
  journal   = {J. Discrete Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {103--108},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.jda.2007.01.004},
  doi       = {10.1016/j.jda.2007.01.004},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jda/FigueroaGJKLP08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/LingasL08,
  author    = {Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Efficient Approximation Algorithms for Shortest Cycles in Undirected
               Graphs},
  booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
               B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
  pages     = {736--746},
  year      = {2008},
  crossref  = {DBLP:conf/latin/2008},
  url       = {https://doi.org/10.1007/978-3-540-78773-0\_63},
  doi       = {10.1007/978-3-540-78773-0\_63},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/LingasL08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KowalukLN08,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas and
               Johannes Nowak},
  title     = {A Path Cover Technique for LCAs in Dags},
  booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
               Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
  pages     = {222--233},
  year      = {2008},
  crossref  = {DBLP:conf/swat/2008},
  url       = {https://doi.org/10.1007/978-3-540-69903-3\_21},
  doi       = {10.1007/978-3-540-69903-3\_21},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/KowalukLN08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/LingasWZ08,
  author    = {Andrzej Lingas and
               Agnieszka Wasylewicz and
               Pawel Zylinski},
  title     = {Linear-Time 3-Approximation Algorithm for the \emph{r} -Star Covering
               Problem},
  booktitle = {{WALCOM:} Algorithms and Computation, Second International Workshop,
               {WALCOM} 2008, Dhaka, Bangladesh, February 7-8, 2008.},
  pages     = {157--168},
  year      = {2008},
  crossref  = {DBLP:conf/walcom/2008},
  url       = {https://doi.org/10.1007/978-3-540-77891-2\_15},
  doi       = {10.1007/978-3-540-77891-2\_15},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/walcom/LingasWZ08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/GasieniecKLW08,
  author    = {Leszek Gasieniec and
               Dariusz R. Kowalski and
               Andrzej Lingas and
               Martin Wahlen},
  title     = {Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform
               Ranges},
  booktitle = {Distributed Computing, 22nd International Symposium, {DISC} 2008,
               Arcachon, France, September 22-24, 2008. Proceedings},
  pages     = {274--288},
  year      = {2008},
  crossref  = {DBLP:conf/wdag/2008},
  url       = {https://doi.org/10.1007/978-3-540-87779-0\_19},
  doi       = {10.1007/978-3-540-87779-0\_19},
  timestamp = {Tue, 13 Jun 2017 10:37:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wdag/GasieniecKLW08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/CzumajL08,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Minimum k-Connected Geometric Networks},
  booktitle = {Encyclopedia of Algorithms},
  year      = {2008},
  crossref  = {DBLP:reference/algo/2008},
  url       = {https://doi.org/10.1007/978-0-387-30162-4\_237},
  doi       = {10.1007/978-0-387-30162-4\_237},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/reference/algo/CzumajL08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DessmarkJLL07,
  author    = {Anders Dessmark and
               Jesper Jansson and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree
               Problem},
  journal   = {Algorithmica},
  volume    = {48},
  number    = {3},
  pages     = {233--248},
  year      = {2007},
  url       = {https://doi.org/10.1007/s00453-007-0080-9},
  doi       = {10.1007/s00453-007-0080-9},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/DessmarkJLL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/Ebbers-BaumannGKKKL07,
  author    = {Annette Ebbers{-}Baumann and
               Ansgar Gr{\"{u}}ne and
               Rolf Klein and
               Marek Karpinski and
               Christian Knauer and
               Andrzej Lingas},
  title     = {Embedding Point Sets into Plane Graphs of Small Dilation},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {17},
  number    = {3},
  pages     = {201--230},
  year      = {2007},
  url       = {https://doi.org/10.1142/S0218195907002318},
  doi       = {10.1142/S0218195907002318},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/Ebbers-BaumannGKKKL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DessmarkJLLP07,
  author    = {Anders Dessmark and
               Jesper Jansson and
               Andrzej Lingas and
               Eva{-}Marta Lundell and
               Mia Persson},
  title     = {On the Approximability of Maximum and Minimum Edge Clique Partition
               Problems},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {18},
  number    = {2},
  pages     = {217--226},
  year      = {2007},
  url       = {https://doi.org/10.1142/S0129054107004656},
  doi       = {10.1142/S0129054107004656},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijfcs/DessmarkJLLP07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LingasWZ07,
  author    = {Andrzej Lingas and
               Agnieszka Wasylewicz and
               Pawel Zylinski},
  title     = {Note on covering monotone orthogonal polygons with star-shaped polygons},
  journal   = {Inf. Process. Lett.},
  volume    = {104},
  number    = {6},
  pages     = {220--227},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.ipl.2007.06.015},
  doi       = {10.1016/j.ipl.2007.06.015},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/LingasWZ07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlonLW07,
  author    = {Noga Alon and
               Andrzej Lingas and
               Martin Wahlen},
  title     = {Approximating the maximum clique minor and some subgraph homeomorphism
               problems},
  journal   = {Theor. Comput. Sci.},
  volume    = {374},
  number    = {1-3},
  pages     = {149--158},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.tcs.2006.12.021},
  doi       = {10.1016/j.tcs.2006.12.021},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/AlonLW07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzumajKL07,
  author    = {Artur Czumaj and
               Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {Faster algorithms for finding lowest common ancestors in directed
               acyclic graphs},
  journal   = {Theor. Comput. Sci.},
  volume    = {380},
  number    = {1-2},
  pages     = {37--46},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.tcs.2007.02.053},
  doi       = {10.1016/j.tcs.2007.02.053},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/CzumajKL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/HanIKL07,
  author    = {Xin Han and
               Kazuo Iwama and
               Rolf Klein and
               Andrzej Lingas},
  title     = {Approximating the Maximum Independent Set and Minimum Vertex Coloring
               on Box Graphs},
  booktitle = {Algorithmic Aspects in Information and Management, Third International
               Conference, {AAIM} 2007, Portland, OR, USA, June 6-8, 2007, Proceedings},
  pages     = {337--345},
  year      = {2007},
  crossref  = {DBLP:conf/aaim/2007},
  url       = {https://doi.org/10.1007/978-3-540-72870-2\_32},
  doi       = {10.1007/978-3-540-72870-2\_32},
  timestamp = {Fri, 27 Oct 2017 16:14:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/aaim/HanIKL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KowalukL07,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix
               Multiplication},
  booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
               October 8-10, 2007, Proceedings},
  pages     = {265--274},
  year      = {2007},
  crossref  = {DBLP:conf/esa/2007},
  url       = {https://doi.org/10.1007/978-3-540-75520-3\_25},
  doi       = {10.1007/978-3-540-75520-3\_25},
  timestamp = {Wed, 15 Nov 2017 16:12:49 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/esa/KowalukL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CzumajL07,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Finding a heaviest triangle is not harder than matrix multiplication},
  booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
               2007},
  pages     = {986--994},
  year      = {2007},
  crossref  = {DBLP:conf/soda/2007},
  url       = {http://dl.acm.org/citation.cfm?id=1283383.1283489},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/CzumajL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/LingasW07,
  author    = {Andrzej Lingas and
               Martin Wahlen},
  title     = {On Exact Complexity of Subgraph Homeomorphism},
  booktitle = {Theory and Applications of Models of Computation, 4th International
               Conference, {TAMC} 2007, Shanghai, China, May 22-25, 2007, Proceedings},
  pages     = {256--261},
  year      = {2007},
  crossref  = {DBLP:conf/tamc/2007},
  url       = {https://doi.org/10.1007/978-3-540-72504-6\_23},
  doi       = {10.1007/978-3-540-72504-6\_23},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/LingasW07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/CzumajL07,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Approximation Schemes for Minimum-Cost k-Connectivity Problems in
               Geometric Graphs},
  booktitle = {Handbook of Approximation Algorithms and Metaheuristics.},
  year      = {2007},
  crossref  = {DBLP:reference/crc/2007aam},
  url       = {https://doi.org/10.1201/9781420010749.ch51},
  doi       = {10.1201/9781420010749.ch51},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/reference/crc/CzumajL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KleinLL06,
  author    = {Rolf Klein and
               Christos Levcopoulos and
               Andrzej Lingas},
  title     = {A {PTAS} for minimum vertex dilation triangulation of a simple polygon
               with a constant number of sources of dilation},
  journal   = {Comput. Geom.},
  volume    = {34},
  number    = {1},
  pages     = {28--34},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.comgeo.2005.06.004},
  doi       = {10.1016/j.comgeo.2005.06.004},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/KleinLL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ChlebusKL06,
  author    = {Bogdan S. Chlebus and
               Dariusz R. Kowalski and
               Andrzej Lingas},
  title     = {Performing work in broadcast networks},
  journal   = {Distributed Computing},
  volume    = {18},
  number    = {6},
  pages     = {435--451},
  year      = {2006},
  url       = {https://doi.org/10.1007/s00446-005-0153-4},
  doi       = {10.1007/s00446-005-0153-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dc/ChlebusKL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LingasG06,
  author    = {Andrzej Lingas and
               Leszek Gasieniec},
  title     = {Preface},
  journal   = {Theor. Comput. Sci.},
  volume    = {354},
  number    = {3},
  pages     = {319},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.tcs.2005.11.028},
  doi       = {10.1016/j.tcs.2005.11.028},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/LingasG06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caan/LingasPW06,
  author    = {Andrzej Lingas and
               Mia Persson and
               Martin Wahlen},
  title     = {Minimum-Energy Broadcasting in Wireless Networks in the \emph{d}-Dimensional
               Euclidean Space (The \emph{alpha}{\textless}=\emph{d} Case)},
  booktitle = {Combinatorial and Algorithmic Aspects of Networking, Third Workshop,
               {CAAN} 2006, Chester, UK, July 2, 2006. Revised Papers},
  pages     = {112--124},
  year      = {2006},
  crossref  = {DBLP:conf/caan/2006},
  url       = {https://doi.org/10.1007/11922377\_10},
  doi       = {10.1007/11922377\_10},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/caan/LingasPW06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/DessmarkJLLP06,
  author    = {Anders Dessmark and
               Jesper Jansson and
               Andrzej Lingas and
               Eva{-}Marta Lundell and
               Mia Persson},
  title     = {On the Approximability of Maximum and Minimum Edge Clique Partition
               Problems},
  booktitle = {Theory of Computing 2006, Proceedings of the Twelfth Computing: The
               Australasian Theory Symposium {(CATS2006).} Hobart, Tasmania, Australia,
               16-19 January 2006, Proceedings},
  pages     = {101--105},
  year      = {2006},
  crossref  = {DBLP:conf/cats/2006},
  url       = {http://crpit.com/abstracts/CRPITV51Dessmark.html},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cats/DessmarkJLLP06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CzumajKL06,
  author    = {Artur Czumaj and
               Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {Faster algorithms for finding lowest common ancestors in directed
               acyclic graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {111},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-111/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CzumajKL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CzumajCL06,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Finding a Heaviest Triangle is not Harder than Matrix Multiplication},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {115},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-115/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CzumajCL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LingasW05,
  author    = {Andrzej Lingas and
               Martin Wahlen},
  title     = {A note on maximum independent set and related problems on box graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {93},
  number    = {4},
  pages     = {169--171},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.ipl.2004.10.013},
  doi       = {10.1016/j.ipl.2004.10.013},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/LingasW05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CzumajHLN05,
  author    = {Artur Czumaj and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Andrzej Lingas and
               Johan Nilsson},
  title     = {Approximation algorithms for optimization problems in graphs with
               superlogarithmic treewidth},
  journal   = {Inf. Process. Lett.},
  volume    = {94},
  number    = {2},
  pages     = {49--53},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.ipl.2004.12.017},
  doi       = {10.1016/j.ipl.2004.12.017},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/CzumajHLN05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JansenKLS05,
  author    = {Klaus Jansen and
               Marek Karpinski and
               Andrzej Lingas and
               Eike Seidel},
  title     = {Polynomial Time Approximation Schemes for {MAX-BISECTION} on Planar
               and Geometric Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {35},
  number    = {1},
  pages     = {110--119},
  year      = {2005},
  url       = {https://doi.org/10.1137/S009753970139567X},
  doi       = {10.1137/S009753970139567X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/JansenKLS05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/FigueroaGJKLP05,
  author    = {Andres Figueroa and
               Avraham Goldstein and
               Tao Jiang and
               Maciej Kurowski and
               Andrzej Lingas and
               Mia Persson},
  title     = {Approximate Clustering of Fingerprint Vectors with Missing Values},
  booktitle = {Theory of Computing 2005, Eleventh {CATS} 2005, Computing: The Australasian
               Theory Symposium, Newcastle, NSW, Australia, January/February 2005},
  pages     = {57--60},
  year      = {2005},
  crossref  = {DBLP:conf/cats/2005},
  url       = {http://crpit.com/confpapers/CRPITV41Figueroa.pdf},
  timestamp = {Thu, 31 Mar 2016 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cats/FigueroaGJKLP05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KowalukL05,
  author    = {Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {{LCA} Queries in Directed Acyclic Graphs},
  booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
               {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  pages     = {241--248},
  year      = {2005},
  crossref  = {DBLP:conf/icalp/2005},
  url       = {https://doi.org/10.1007/11523468\_20},
  doi       = {10.1007/11523468\_20},
  timestamp = {Wed, 14 Nov 2018 11:00:13 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/KowalukL05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Ebbers-BaumannGKKKL05,
  author    = {Annette Ebbers{-}Baumann and
               Ansgar Gr{\"{u}}ne and
               Marek Karpinski and
               Rolf Klein and
               Christian Knauer and
               Andrzej Lingas},
  title     = {Embedding Point Sets into Plane Graphs of Small Dilation},
  booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
               2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  pages     = {5--16},
  year      = {2005},
  crossref  = {DBLP:conf/isaac/2005},
  url       = {https://doi.org/10.1007/11602613\_3},
  doi       = {10.1007/11602613\_3},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/Ebbers-BaumannGKKKL05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/IwamaLO05,
  author    = {Kazuo Iwama and
               Andrzej Lingas and
               Masaki Okita},
  title     = {Max-stretch Reduction for Tree Spanners},
  booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
               2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
  pages     = {122--133},
  year      = {2005},
  crossref  = {DBLP:conf/wads/2005},
  url       = {https://doi.org/10.1007/11534273\_12},
  doi       = {10.1007/11534273\_12},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/IwamaLO05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Ebbers-BaumannKLL04,
  author    = {Annette Ebbers{-}Baumann and
               Rolf Klein and
               Elmar Langetepe and
               Andrzej Lingas},
  title     = {A fast algorithm for approximating the detour of a polygonal chain},
  journal   = {Comput. Geom.},
  volume    = {27},
  number    = {2},
  pages     = {123--134},
  year      = {2004},
  url       = {https://doi.org/10.1016/S0925-7721(03)00046-4},
  doi       = {10.1016/S0925-7721(03)00046-4},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/Ebbers-BaumannKLL04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/KarpinskiKL04,
  author    = {Marek Karpinski and
               Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {Approximation Algorithms for {MAX-BISECTION} on Low Degree Regular
               Graphs},
  journal   = {Fundam. Inform.},
  volume    = {62},
  number    = {3-4},
  pages     = {369--375},
  year      = {2004},
  url       = {http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-05},
  timestamp = {Mon, 18 May 2015 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/fuin/KarpinskiKL04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GasieniecJL04,
  author    = {Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas},
  title     = {Approximation algorithms for Hamming clustering problems},
  journal   = {J. Discrete Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {289--301},
  year      = {2004},
  url       = {https://doi.org/10.1016/S1570-8667(03)00079-0},
  doi       = {10.1016/S1570-8667(03)00079-0},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jda/GasieniecJL04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/DessmarkJLL04,
  author    = {Anders Dessmark and
               Jesper Jansson and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree
               Problem},
  booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
               Istanbul,Turkey, July 5-7, 2004, Proceedings},
  pages     = {220--229},
  year      = {2004},
  crossref  = {DBLP:conf/cpm/2004},
  url       = {https://doi.org/10.1007/978-3-540-27801-6\_16},
  doi       = {10.1007/978-3-540-27801-6\_16},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/DessmarkJLL04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DessmarkLL04,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Subexponential-Time Framework for Optimal Embeddings of Graphs in
               Integer Lattices},
  booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
               Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
  pages     = {248--259},
  year      = {2004},
  crossref  = {DBLP:conf/swat/2004},
  url       = {https://doi.org/10.1007/978-3-540-27810-8\_22},
  doi       = {10.1007/978-3-540-27810-8\_22},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/DessmarkLL04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-039,
  author    = {Andrzej Lingas and
               Martin Wahlen},
  title     = {On approximation of the maximum clique minor containment problem and
               some subgraph homeomorphism problems},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {039},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-039/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR04-039},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/JanssonL03,
  author    = {Jesper Jansson and
               Andrzej Lingas},
  title     = {A Fast Algorithm for Optimal Alignment between Similar Ordered Trees},
  journal   = {Fundam. Inform.},
  volume    = {56},
  number    = {1-2},
  pages     = {105--120},
  year      = {2003},
  url       = {http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-07},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/fuin/JanssonL03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/DessmarkLP03,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Andrzej Pelc},
  title     = {Trade-Offs Between Load and Degree in Virtual Path Layouts},
  journal   = {Parallel Processing Letters},
  volume    = {13},
  number    = {3},
  pages     = {485--496},
  year      = {2003},
  url       = {https://doi.org/10.1142/S0129626403001446},
  doi       = {10.1142/S0129626403001446},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ppl/DessmarkLP03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LingasW03,
  author    = {Andrzej Lingas and
               Martin Wahlen},
  title     = {Subexponential-Time Algorithms for Maximum Independent Set and Related
               Problems on Box Graphs},
  booktitle = {Computing and Combinatorics, 9th Annual International Conference,
               {COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
  pages     = {50--56},
  year      = {2003},
  crossref  = {DBLP:conf/cocoon/2003},
  url       = {https://doi.org/10.1007/3-540-45071-8\_7},
  doi       = {10.1007/3-540-45071-8\_7},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/LingasW03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CzumajLN03,
  author    = {Artur Czumaj and
               Andrzej Lingas and
               Johan Nilsson},
  title     = {Improved Approximation Algorithms for Optimization Problems in Graphs
               with Superlogarithmic Treewidth},
  booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
               2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
  pages     = {544--553},
  year      = {2003},
  crossref  = {DBLP:conf/isaac/2003},
  url       = {https://doi.org/10.1007/978-3-540-24587-2\_56},
  doi       = {10.1007/978-3-540-24587-2\_56},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/CzumajLN03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GasieniecL03,
  author    = {Leszek Gasieniec and
               Andrzej Lingas},
  title     = {An Improved Bound on Boolean Matrix Multiplication for Highly Clustered
               Data},
  booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
               2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
  pages     = {329--339},
  year      = {2003},
  crossref  = {DBLP:conf/wads/2003},
  url       = {https://doi.org/10.1007/978-3-540-45078-8\_29},
  doi       = {10.1007/978-3-540-45078-8\_29},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/GasieniecL03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fct/2003,
  editor    = {Andrzej Lingas and
               Bengt J. Nilsson},
  title     = {Fundamentals of Computation Theory, 14th International Symposium,
               {FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2751},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/b11926},
  doi       = {10.1007/b11926},
  isbn      = {3-540-40543-7},
  timestamp = {Mon, 29 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fct/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominL02,
  author    = {Fedor V. Fomin and
               Andrzej Lingas},
  title     = {Approximation algorithms for time-dependent orienteering},
  journal   = {Inf. Process. Lett.},
  volume    = {83},
  number    = {2},
  pages     = {57--62},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0020-0190(01)00313-1},
  doi       = {10.1016/S0020-0190(01)00313-1},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/FominL02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GasieniecL02,
  author    = {Leszek Gasieniec and
               Andrzej Lingas},
  title     = {On adaptive deterministic gossiping in ad hoc radio networks},
  journal   = {Inf. Process. Lett.},
  volume    = {83},
  number    = {2},
  pages     = {89--93},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0020-0190(01)00312-X},
  doi       = {10.1016/S0020-0190(01)00312-X},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/GasieniecL02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChristerssonGL02,
  author    = {Malin Christersson and
               Leszek Gasieniec and
               Andrzej Lingas},
  title     = {Gossiping with Bounded Size Messages in ad hoc Radio Networks},
  booktitle = {Automata, Languages and Programming, 29th International Colloquium,
               {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  pages     = {377--389},
  year      = {2002},
  crossref  = {DBLP:conf/icalp/2002},
  url       = {https://doi.org/10.1007/3-540-45465-9\_33},
  doi       = {10.1007/3-540-45465-9\_33},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/ChristerssonGL02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CzumajLZ02,
  author    = {Artur Czumaj and
               Andrzej Lingas and
               Hairong Zhao},
  title     = {Polynomial-Time Approximation Schemes for the Euclidean Survivable
               Network Design Problem},
  booktitle = {Automata, Languages and Programming, 29th International Colloquium,
               {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  pages     = {973--984},
  year      = {2002},
  crossref  = {DBLP:conf/icalp/2002},
  url       = {https://doi.org/10.1007/3-540-45465-9\_83},
  doi       = {10.1007/3-540-45465-9\_83},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/CzumajLZ02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Lingas02,
  author    = {Andrzej Lingas},
  title     = {A Geometric Approach to Boolean Matrix Multiplication},
  booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
               2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
  pages     = {501--510},
  year      = {2002},
  crossref  = {DBLP:conf/isaac/2002},
  url       = {https://doi.org/10.1007/3-540-36136-7\_44},
  doi       = {10.1007/3-540-36136-7\_44},
  timestamp = {Fri, 02 Nov 2018 09:43:26 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/Lingas02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GasieniecL02,
  author    = {Leszek Gasieniec and
               Andrzej Lingas},
  title     = {On adaptive deterministic gossiping in ad hoc radio networks},
  booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA.}},
  pages     = {689--690},
  year      = {2002},
  crossref  = {DBLP:conf/soda/2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545473},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GasieniecL02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosLM02,
  author    = {Christos Levcopoulos and
               Andrzej Lingas and
               Joseph S. B. Mitchell},
  title     = {Adaptive Algorithms for Constructing Convex Hulls and Triangulations
               of Polygonal Chains},
  booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
               Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  pages     = {80--89},
  year      = {2002},
  crossref  = {DBLP:conf/swat/2002},
  url       = {https://doi.org/10.1007/3-540-45471-3\_9},
  doi       = {10.1007/3-540-45471-3\_9},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/swat/LevcopoulosLM02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LingasOO01,
  author    = {Andrzej Lingas and
               Hans Olsson and
               Anna {\"{O}}stlin},
  title     = {Efficient Merging and Construction of Evolutionary Trees},
  journal   = {J. Algorithms},
  volume    = {41},
  number    = {1},
  pages     = {41--51},
  year      = {2001},
  url       = {https://doi.org/10.1006/jagm.2001.1168},
  doi       = {10.1006/jagm.2001.1168},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jal/LingasOO01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArikatiDLM01,
  author    = {Srinivasa Rao Arikati and
               Anders Dessmark and
               Andrzej Lingas and
               Madhav V. Marathe},
  title     = {Approximation algorithms for maximum two-dimensional pattern matching},
  journal   = {Theor. Comput. Sci.},
  volume    = {255},
  number    = {1-2},
  pages     = {51--62},
  year      = {2001},
  url       = {https://doi.org/10.1016/S0304-3975(99)00153-X},
  doi       = {10.1016/S0304-3975(99)00153-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/ArikatiDLM01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/JanssonL01,
  author    = {Jesper Jansson and
               Andrzej Lingas},
  title     = {A Fast Algorithm for Optimal Alignment between Similar Ordered Trees},
  booktitle = {Combinatorial Pattern Matching, 12th Annual Symposium, {CPM} 2001
               Jerusalem, Israel, July 1-4, 2001 Proceedings},
  pages     = {232--240},
  year      = {2001},
  crossref  = {DBLP:conf/cpm/2001},
  url       = {https://doi.org/10.1007/3-540-48194-X\_22},
  doi       = {10.1007/3-540-48194-X\_22},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/JanssonL01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dialm/ChlebusGLP01,
  author    = {Bogdan S. Chlebus and
               Leszek Gasieniec and
               Andrzej Lingas and
               Aris Pagourtzis},
  title     = {Oblivious gossiping in ad-hoc radio networks},
  booktitle = {Proceedings of the 5th International Workshop on Discrete Algorithms
               and Methods for Mobile Computing and Communications {(DIAL-M} 2001),
               Rome, Italy, July 21, 2001},
  pages     = {44--51},
  year      = {2001},
  crossref  = {DBLP:conf/dialm/2001},
  url       = {https://doi.org/10.1145/381448.381454},
  doi       = {10.1145/381448.381454},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/dialm/ChlebusGLP01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Ebbers-BaumannKLL01,
  author    = {Annette Ebbers{-}Baumann and
               Rolf Klein and
               Elmar Langetepe and
               Andrzej Lingas},
  title     = {A Fast Algorithm for Approximating the Detour of a Polygonal Chain},
  booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
               August 28-31, 2001, Proceedings},
  pages     = {321--332},
  year      = {2001},
  crossref  = {DBLP:conf/esa/2001},
  url       = {https://doi.org/10.1007/3-540-44676-1\_27},
  doi       = {10.1007/3-540-44676-1\_27},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/Ebbers-BaumannKLL01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/FominL01,
  author    = {Fedor V. Fomin and
               Andrzej Lingas},
  title     = {Approximation Algorithms for Time-Dependent Orienteering},
  booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
               {FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
  pages     = {508--515},
  year      = {2001},
  crossref  = {DBLP:conf/fct/2001},
  url       = {https://doi.org/10.1007/3-540-44669-9\_57},
  doi       = {10.1007/3-540-44669-9\_57},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fct/FominL01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ChlebusKL01,
  author    = {Bogdan S. Chlebus and
               Dariusz R. Kowalski and
               Andrzej Lingas},
  title     = {The do-all problem in broadcast networks},
  booktitle = {Proceedings of the Twentieth Annual {ACM} Symposium on Principles
               of Distributed Computing, {PODC} 2001, Newport, Rhode Island, USA,
               August 26-29, 2001},
  pages     = {117--127},
  year      = {2001},
  crossref  = {DBLP:conf/podc/2001},
  url       = {https://doi.org/10.1145/383962.384000},
  doi       = {10.1145/383962.384000},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/podc/ChlebusKL01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenKLS01,
  author    = {Klaus Jansen and
               Marek Karpinski and
               Andrzej Lingas and
               Eike Seidel},
  title     = {Polynomial Time Approximation Schemes for {MAX-BISECTION} on Planar
               and Geometric Graphs},
  booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
               Science, Dresden, Germany, February 15-17, 2001, Proceedings},
  pages     = {365--375},
  year      = {2001},
  crossref  = {DBLP:conf/stacs/2001},
  url       = {https://doi.org/10.1007/3-540-44693-1\_32},
  doi       = {10.1007/3-540-44693-1\_32},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/JansenKLS01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BjorklundL01,
  author    = {Andreas Bj{\"{o}}rklund and
               Andrzej Lingas},
  title     = {Fast Boolean Matrix Multiplication for Highly Clustered Data},
  booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
               2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
  pages     = {258--263},
  year      = {2001},
  crossref  = {DBLP:conf/wads/2001},
  url       = {https://doi.org/10.1007/3-540-44634-6\_24},
  doi       = {10.1007/3-540-44634-6\_24},
  timestamp = {Mon, 05 Jun 2017 12:38:39 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/BjorklundL01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DessmarkLP00,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Andrzej Proskurowski},
  title     = {Faster Algorithms for Subgraph Isomorphism of k-Connected Partial
               k-Trees},
  journal   = {Algorithmica},
  volume    = {27},
  number    = {3},
  pages     = {337--347},
  year      = {2000},
  url       = {https://doi.org/10.1007/s004530010023},
  doi       = {10.1007/s004530010023},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/DessmarkLP00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KovacsL00,
  author    = {Tomas Kovacs and
               Andrzej Lingas},
  title     = {Maximum packing for biconnected outerplanar graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {100},
  number    = {1-2},
  pages     = {85--94},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0166-218X(99)00176-6},
  doi       = {10.1016/S0166-218X(99)00176-6},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/KovacsL00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DessmarkLP00,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Andrzej Proskurowski},
  title     = {Maximum packing for k-connected partial k-trees in polynomial time},
  journal   = {Theor. Comput. Sci.},
  volume    = {236},
  number    = {1-2},
  pages     = {179--191},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0304-3975(99)00208-X},
  doi       = {10.1016/S0304-3975(99)00208-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/DessmarkLP00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GasieniecJL00,
  author    = {Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas},
  title     = {Approximation Algorithms for Hamming Clustering Problems},
  booktitle = {Combinatorial Pattern Matching, 11th Annual Symposium, {CPM} 2000,
               Montreal, Canada, June 21-23, 2000, Proceedings},
  pages     = {108--118},
  year      = {2000},
  crossref  = {DBLP:conf/cpm/2000},
  url       = {https://doi.org/10.1007/3-540-45123-4\_11},
  doi       = {10.1007/3-540-45123-4\_11},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/GasieniecJL00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CzumajL00,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Fast Approximation Schemes for Euclidean Multi-connectivity Problems},
  booktitle = {Automata, Languages and Programming, 27th International Colloquium,
               {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  pages     = {856--868},
  year      = {2000},
  crossref  = {DBLP:conf/icalp/2000},
  url       = {https://doi.org/10.1007/3-540-45022-X\_72},
  doi       = {10.1007/3-540-45022-X\_72},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/CzumajL00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-051,
  author    = {Marek Karpinski and
               Miroslaw Kowaluk and
               Andrzej Lingas},
  title     = {Approximation Algorithms for {MAX-BISECTION} on Low Degree Reg ular
               Graphs and Planar Graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {51},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-051/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR00-051},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-064,
  author    = {Klaus Jansen and
               Marek Karpinski and
               Andrzej Lingas},
  title     = {A Polynomial Time Approximation Scheme for {MAX-BISECTION} on Planar
               Graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {64},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-064/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR00-064},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GasieniecJLO99,
  author    = {Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas and
               Anna {\"{O}}stlin},
  title     = {On the Complexity of Constructing Evolutionary Trees},
  journal   = {J. Comb. Optim.},
  volume    = {3},
  number    = {2-3},
  pages     = {183--197},
  year      = {1999},
  url       = {https://doi.org/10.1023/A:1009833626004},
  doi       = {10.1023/A:1009833626004},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jco/GasieniecJLO99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/DiksLP99,
  author    = {Krzysztof Diks and
               Andrzej Lingas and
               Andrzej Pelc},
  title     = {An Optimal Algorithm for Broadcasting Multiple Messages in Trees},
  journal   = {J. Parallel Distrib. Comput.},
  volume    = {59},
  number    = {3},
  pages     = {465--474},
  year      = {1999},
  url       = {https://doi.org/10.1006/jpdc.1999.1584},
  doi       = {10.1006/jpdc.1999.1584},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jpdc/DiksLP99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LingasOO99,
  author    = {Andrzej Lingas and
               Hans Olsson and
               Anna {\"{O}}stlin},
  title     = {Efficient Merging, Construction, and Maintenance of Evolutionary Trees},
  booktitle = {Automata, Languages and Programming, 26th International Colloquium,
               ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
  pages     = {544--553},
  year      = {1999},
  crossref  = {DBLP:conf/icalp/99},
  url       = {https://doi.org/10.1007/3-540-48523-6\_51},
  doi       = {10.1007/3-540-48523-6\_51},
  timestamp = {Wed, 14 Nov 2018 11:00:14 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/LingasOO99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CzumajL99,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {On Approximability of the Minimum-Cost \emph{k}-Connected Spanning
               Subgraph Problem},
  booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland, {USA.}},
  pages     = {281--290},
  year      = {1999},
  crossref  = {DBLP:conf/soda/1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500.314573},
  timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/CzumajL99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GasieniecJL99,
  author    = {Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas},
  title     = {Efficient Approximation Algorithms for the Hamming Center Problem},
  booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland, {USA.}},
  pages     = {905--906},
  year      = {1999},
  crossref  = {DBLP:conf/soda/1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500.315081},
  timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GasieniecJL99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KaoLO99,
  author    = {Ming{-}Yang Kao and
               Andrzej Lingas and
               Anna {\"{O}}stlin},
  title     = {Balanced Randomized Tree Splitting with Applications to Evolutionary
               Tree Constructions},
  booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
               Science, Trier, Germany, March 4-6, 1999, Proceedings},
  pages     = {184--196},
  year      = {1999},
  crossref  = {DBLP:conf/stacs/1999},
  url       = {https://doi.org/10.1007/3-540-49116-3\_17},
  doi       = {10.1007/3-540-49116-3\_17},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/KaoLO99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DessmarkGL98,
  author    = {Anders Dessmark and
               Oscar Garrido and
               Andrzej Lingas},
  title     = {A Note on Parallel Complexity of Maximum \emph{f}-Matching},
  journal   = {Inf. Process. Lett.},
  volume    = {65},
  number    = {2},
  pages     = {107--109},
  year      = {1998},
  url       = {https://doi.org/10.1016/S0020-0190(97)00196-8},
  doi       = {10.1016/S0020-0190(97)00196-8},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/DessmarkGL98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/DessmarkL98,
  author    = {Anders Dessmark and
               Andrzej Lingas},
  title     = {Improved Bounds for Integer Sorting in the {EREW} {PRAM} Model},
  journal   = {J. Parallel Distrib. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {64--70},
  year      = {1998},
  url       = {https://doi.org/10.1006/jpdc.1997.1401},
  doi       = {10.1006/jpdc.1997.1401},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jpdc/DessmarkL98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LingasS98,
  author    = {Andrzej Lingas and
               Valeriu Soltan},
  title     = {Minimum Convex Partition of a Polygon with Holes by Cuts in Given
               Directions},
  journal   = {Theory Comput. Syst.},
  volume    = {31},
  number    = {5},
  pages     = {507--538},
  year      = {1998},
  url       = {https://doi.org/10.1007/s002240000101},
  doi       = {10.1007/s002240000101},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/mst/LingasS98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/GasieniecJLO98,
  author    = {Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas and
               Anna {\"{O}}stlin},
  title     = {Inferring Ordered Trees from Local Constraints},
  booktitle = {Proceedings of Computing: The Fourth Australasian Theory Symposium
               (CATS'98), Perth, WA, Australia, February 2-3, 1998},
  pages     = {67--76},
  year      = {1998},
  crossref  = {DBLP:conf/cats/1998},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cats/GasieniecJLO98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Lingas98,
  author    = {Andrzej Lingas},
  title     = {Subexponential-time algorithms for minimum weight triangulations and
               related problems},
  booktitle = {Proceedings of the 10th Canadian Conference on Computational Geometry,
               McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
               August 10-12, 1998},
  year      = {1998},
  crossref  = {DBLP:conf/cccg/1998},
  url       = {http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-lingas-subexponential.ps.gz},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/Lingas98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CzumajL98,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {A Polynomial Time Approximation Scheme for Euclidean Minimum Cost
               k-Connectivity},
  booktitle = {Automata, Languages and Programming, 25th International Colloquium,
               ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
  pages     = {682--694},
  year      = {1998},
  crossref  = {DBLP:conf/icalp/1998},
  url       = {https://doi.org/10.1007/BFb0055093},
  doi       = {10.1007/BFb0055093},
  timestamp = {Tue, 23 May 2017 11:53:58 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/CzumajL98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/DessmarkDLW98,
  author    = {Anders Dessmark and
               Carsten Dorgerloh and
               Andrzej Lingas and
               Juergen Wirtgen},
  title     = {Ultrafast Randomized Parallel Construction and Approximation Algorithms
               for Spanning Forests in Dense Graphs},
  booktitle = {{IPPS/SPDP} Workshops},
  pages     = {392--399},
  year      = {1998},
  url       = {https://doi.org/10.1007/3-540-64359-1\_713},
  doi       = {10.1007/3-540-64359-1\_713},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ipps/DessmarkDLW98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DessmarkLOY98,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Hans Olsson and
               Hiroaki Yamamoto},
  title     = {Optimal Broadcasting in Almost Trees and Partial k-trees},
  booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
               Science, Paris, France, February 25-27, 1998, Proceedings},
  pages     = {432--443},
  year      = {1998},
  crossref  = {DBLP:conf/stacs/1998},
  url       = {https://doi.org/10.1007/BFb0028579},
  doi       = {10.1007/BFb0028579},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/DessmarkLOY98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/LingasM97,
  author    = {Andrzej Lingas and
               Anil Maheshwari},
  title     = {A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree},
  journal   = {Parallel Processing Letters},
  volume    = {7},
  number    = {1},
  pages     = {3--11},
  year      = {1997},
  url       = {https://doi.org/10.1142/S0129626497000036},
  doi       = {10.1142/S0129626497000036},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ppl/LingasM97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BermanL97,
  author    = {Piotr Berman and
               Andrzej Lingas},
  title     = {A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex
               Polygon},
  journal   = {Theor. Comput. Sci.},
  volume    = {174},
  number    = {1-2},
  pages     = {193--202},
  year      = {1997},
  url       = {https://doi.org/10.1016/S0304-3975(96)00024-2},
  doi       = {10.1016/S0304-3975(96)00024-2},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/BermanL97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lingas97,
  author    = {Andrzej Lingas},
  title     = {Maximum Tree-Packing in Time O(n\({}^{\mbox{5/2}}\))},
  journal   = {Theor. Comput. Sci.},
  volume    = {181},
  number    = {2},
  pages     = {307--316},
  year      = {1997},
  url       = {https://doi.org/10.1016/S0304-3975(96)00276-9},
  doi       = {10.1016/S0304-3975(96)00276-9},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/Lingas97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GasieniecJLO97,
  author    = {Leszek Gasieniec and
               Jesper Jansson and
               Andrzej Lingas and
               Anna {\"{O}}stlin},
  title     = {On the Complexity of Computing Evolutionary Trees},
  booktitle = {Computing and Combinatorics, Third Annual International Conference,
               {COCOON} '97, Shanghai, China, August 20-22, 1997, Proceedings},
  pages     = {134--145},
  year      = {1997},
  crossref  = {DBLP:conf/cocoon/1997},
  url       = {https://doi.org/10.1007/BFb0045080},
  doi       = {10.1007/BFb0045080},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/GasieniecJLO97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/DiksLP97,
  author    = {Krzysztof Diks and
               Andrzej Lingas and
               Andrzej Pelc},
  title     = {An Optimal Algorithm for Broadcasting Multiple Messages in Trees},
  booktitle = {SIROCCO'97, 4th International Colloquium on Structural Information
               {\&} Communication Complexity, Monte Verita, Ascona, Switzerland,
               July 24-26, 1997},
  pages     = {69--80},
  year      = {1997},
  crossref  = {DBLP:conf/sirocco/1997},
  timestamp = {Fri, 30 Jan 2004 14:02:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sirocco/DiksLP97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tapsoft/KovacL97,
  author    = {Tomas Kovacs and
               Andrzej Lingas},
  title     = {Maximum Packing for Biconnected Outerplanar Graphs},
  booktitle = {TAPSOFT'97: Theory and Practice of Software Development, 7th International
               Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings},
  pages     = {393--404},
  year      = {1997},
  crossref  = {DBLP:conf/tapsoft/1997},
  url       = {https://doi.org/10.1007/BFb0030613},
  doi       = {10.1007/BFb0030613},
  timestamp = {Mon, 22 May 2017 17:11:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tapsoft/KovacL97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/KleinL96,
  author    = {Rolf Klein and
               Andrzej Lingas},
  title     = {A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram
               of a Simple Polygon},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {6},
  number    = {3},
  pages     = {263--278},
  year      = {1996},
  url       = {https://doi.org/10.1142/S0218195996000198},
  doi       = {10.1142/S0218195996000198},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/KleinL96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GarridoJLR96,
  author    = {Oscar Garrido and
               Stefan Jarominek and
               Andrzej Lingas and
               Wojciech Rytter},
  title     = {A Simple Randomized Parallel Algorithm for Maximal f-Matchings},
  journal   = {Inf. Process. Lett.},
  volume    = {57},
  number    = {2},
  pages     = {83--87},
  year      = {1996},
  url       = {https://doi.org/10.1016/0020-0190(95)00179-4},
  doi       = {10.1016/0020-0190(95)00179-4},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/GarridoJLR96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AspvallLLS96,
  author    = {Bengt Aspvall and
               Christos Levcopoulos and
               Andrzej Lingas and
               Robert Storlind},
  title     = {On 2-QBF Truth Testing in Parallel},
  journal   = {Inf. Process. Lett.},
  volume    = {57},
  number    = {2},
  pages     = {89--93},
  year      = {1996},
  url       = {https://doi.org/10.1016/0020-0190(95)00180-8},
  doi       = {10.1016/0020-0190(95)00180-8},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/AspvallLLS96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GarridoKL96,
  author    = {Oscar Garrido and
               Pierre Kelsen and
               Andrzej Lingas},
  title     = {A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph
               of Poly-Log Arboricity},
  journal   = {Inf. Process. Lett.},
  volume    = {58},
  number    = {2},
  pages     = {55--58},
  year      = {1996},
  url       = {https://doi.org/10.1016/0020-0190(96)00040-3},
  doi       = {10.1016/0020-0190(96)00040-3},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/GarridoKL96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/KarlssonL96,
  author    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {Guest Editor's Foreword},
  journal   = {Nord. J. Comput.},
  volume    = {3},
  number    = {4},
  pages     = {293--294},
  year      = {1996},
  timestamp = {Mon, 24 Jul 2006 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/njc/KarlssonL96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ArikatiDLM96,
  author    = {Srinivasa Rao Arikati and
               Anders Dessmark and
               Andrzej Lingas and
               Madhav V. Marathe},
  title     = {Approximation Algorithms for Maximum Two-Dimensional Pattern Matching},
  booktitle = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna
               Beach, California, USA, June 10-12, 1996, Proceedings},
  pages     = {348--360},
  year      = {1996},
  crossref  = {DBLP:conf/cpm/1996},
  url       = {https://doi.org/10.1007/3-540-61258-0\_25},
  doi       = {10.1007/3-540-61258-0\_25},
  timestamp = {Mon, 22 May 2017 16:14:05 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/ArikatiDLM96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DessmarkLP96,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Andrzej Proskurowski},
  title     = {Faster Algorithms for Subgraph Isomorphism of k-Connected Partial
               k-Trees},
  booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
               Spain, September 25-27, 1996, Proceedings},
  pages     = {501--513},
  year      = {1996},
  crossref  = {DBLP:conf/esa/1996},
  url       = {https://doi.org/10.1007/3-540-61680-2\_78},
  doi       = {10.1007/3-540-61680-2\_78},
  timestamp = {Thu, 15 Jun 2017 21:39:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/DessmarkLP96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LingasS96,
  author    = {Andrzej Lingas and
               Valeriu Soltan},
  title     = {Minimum Convex Partition of a Polygon with Holes by Cuts in Given
               Directions},
  booktitle = {Algorithms and Computation, 7th International Symposium, {ISAAC} '96,
               Osaka, Japan, December 16-18, 1996, Proceedings},
  pages     = {315--325},
  year      = {1996},
  crossref  = {DBLP:conf/isaac/1996},
  url       = {https://doi.org/10.1007/BFb0009508},
  doi       = {10.1007/BFb0009508},
  timestamp = {Mon, 22 May 2017 16:14:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/LingasS96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DessmarkL96,
  author    = {Anders Dessmark and
               Andrzej Lingas},
  title     = {On the Power of Nonconservative {PRAM}},
  booktitle = {Mathematical Foundations of Computer Science 1996, 21st International
               Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings},
  pages     = {303--311},
  year      = {1996},
  crossref  = {DBLP:conf/mfcs/1996},
  url       = {https://doi.org/10.1007/3-540-61550-4\_157},
  doi       = {10.1007/3-540-61550-4\_157},
  timestamp = {Mon, 22 May 2017 16:14:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/DessmarkL96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1996,
  editor    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
               Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1097},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61422-2},
  doi       = {10.1007/3-540-61422-2},
  isbn      = {3-540-61422-2},
  timestamp = {Mon, 22 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/1996},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LingasMS95,
  author    = {Andrzej Lingas and
               Anil Maheshwari and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Optimal Parallel Algorithms for Rectilinear Link-Distance Problems},
  journal   = {Algorithmica},
  volume    = {14},
  number    = {3},
  pages     = {261--289},
  year      = {1995},
  url       = {https://doi.org/10.1007/BF01206332},
  doi       = {10.1007/BF01206332},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/LingasMS95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/KleinL95,
  author    = {Rolf Klein and
               Andrzej Lingas},
  title     = {Manhattonian proximity in a simple polygon},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {5},
  pages     = {53--74},
  year      = {1995},
  url       = {https://doi.org/10.1142/S0218195995000052},
  doi       = {10.1142/S0218195995000052},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/KleinL95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/DjidjevL95,
  author    = {Hristo Djidjev and
               Andrzej Lingas},
  title     = {On computing Voronoi diagrams for sorted point sets},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {5},
  number    = {3},
  pages     = {327--337},
  year      = {1995},
  url       = {https://doi.org/10.1142/S0218195995000192},
  doi       = {10.1142/S0218195995000192},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/DjidjevL95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DessmarkLM95,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Anil Maheshwari},
  title     = {Multilist Layering: Complexity and Applications},
  journal   = {Theor. Comput. Sci.},
  volume    = {141},
  number    = {1{\&}2},
  pages     = {337--350},
  year      = {1995},
  url       = {https://doi.org/10.1016/0304-3975(94)00213-3},
  doi       = {10.1016/0304-3975(94)00213-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/DessmarkLM95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Lingas95,
  author    = {Andrzej Lingas},
  title     = {Maximum Tree-Packing in Time O(n\({}^{\mbox{5/2}}\))},
  booktitle = {Computing and Combinatorics, First Annual International Conference,
               {COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
  pages     = {121--130},
  year      = {1995},
  crossref  = {DBLP:conf/cocoon/1995},
  url       = {https://doi.org/10.1007/BFb0030826},
  doi       = {10.1007/BFb0030826},
  timestamp = {Sat, 20 May 2017 15:32:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/Lingas95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KleinL95,
  author    = {Rolf Klein and
               Andrzej Lingas},
  title     = {Fast Skeleton Construction},
  booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
               September 25-27, 1995, Proceedings},
  pages     = {582--595},
  year      = {1995},
  crossref  = {DBLP:conf/esa/1995},
  url       = {https://doi.org/10.1007/3-540-60313-1\_172},
  doi       = {10.1007/3-540-60313-1\_172},
  timestamp = {Sat, 20 May 2017 15:32:49 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/KleinL95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LevcopoulosLW95,
  author    = {Christos Levcopoulos and
               Andrzej Lingas and
               Cao Wang},
  title     = {On Parallel Complexity of Planar Triangulations},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
  pages     = {413--427},
  year      = {1995},
  crossref  = {DBLP:conf/fsttcs/1995},
  url       = {https://doi.org/10.1007/3-540-60692-0\_64},
  doi       = {10.1007/3-540-60692-0\_64},
  timestamp = {Mon, 22 May 2017 16:14:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/LevcopoulosLW95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/LingasM95,
  author    = {Andrzej Lingas and
               Asish Mukhopadhyay},
  title     = {A Linear-time Construction of the Relative Neighborhood Graph within
               a Histogram},
  booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
               '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
  pages     = {228--238},
  year      = {1995},
  crossref  = {DBLP:conf/wads/1995},
  url       = {https://doi.org/10.1007/3-540-60220-8\_65},
  doi       = {10.1007/3-540-60220-8\_65},
  timestamp = {Mon, 05 Jun 2017 12:38:39 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/LingasM95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Lingas94,
  author    = {Andrzej Lingas},
  title     = {A Linear-time Construction of the Relative Neighborhood Graph From
               the Delaunay Triangulation},
  journal   = {Comput. Geom.},
  volume    = {4},
  pages     = {199--208},
  year      = {1994},
  url       = {https://doi.org/10.1016/0925-7721(94)90018-3},
  doi       = {10.1016/0925-7721(94)90018-3},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/Lingas94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/Lingas94,
  author    = {Andrzej Lingas},
  title     = {Editor's Foreword},
  journal   = {Nord. J. Comput.},
  volume    = {1},
  number    = {3},
  pages     = {273},
  year      = {1994},
  timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/njc/Lingas94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KleinL94,
  author    = {Rolf Klein and
               Andrzej Lingas},
  title     = {Hamiltonian Abstract Voronoi Diagrams in Linear Time},
  booktitle = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
               Beijing, P. R. China, August 25-27, 1994, Proceedings},
  pages     = {11--19},
  year      = {1994},
  crossref  = {DBLP:conf/isaac/1994},
  url       = {https://doi.org/10.1007/3-540-58325-4\_161},
  doi       = {10.1007/3-540-58325-4\_161},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/KleinL94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DessmarkLG94,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Oscar Garrido},
  title     = {On Parallel Complexity of Maximum f-matching and the Degree Sequence
               Problem},
  booktitle = {Mathematical Foundations of Computer Science 1994, 19th International
               Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings},
  pages     = {316--325},
  year      = {1994},
  crossref  = {DBLP:conf/mfcs/1994},
  url       = {https://doi.org/10.1007/3-540-58338-6\_78},
  doi       = {10.1007/3-540-58338-6\_78},
  timestamp = {Wed, 14 Nov 2018 10:59:26 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/DessmarkLG94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MaheshwariL94,
  author    = {Anil Maheshwari and
               Andrzej Lingas},
  title     = {A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree},
  booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
               Science, Caen, France, February 24-26, 1994, Proceedings},
  pages     = {487--495},
  year      = {1994},
  crossref  = {DBLP:conf/stacs/1994},
  url       = {https://doi.org/10.1007/3-540-57785-8\_165},
  doi       = {10.1007/3-540-57785-8\_165},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/MaheshwariL94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BermanL94,
  author    = {Piotr Berman and
               Andrzej Lingas},
  title     = {A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex
               Polygon},
  booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
               Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
  pages     = {73--82},
  year      = {1994},
  crossref  = {DBLP:conf/swat/1994},
  url       = {https://doi.org/10.1007/3-540-58218-5\_7},
  doi       = {10.1007/3-540-58218-5\_7},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/BermanL94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DiksGL93,
  author    = {Krzysztof Diks and
               Oscar Garrido and
               Andrzej Lingas},
  title     = {Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal
               f-Matchings},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {4},
  number    = {2},
  pages     = {179--192},
  year      = {1993},
  url       = {https://doi.org/10.1142/S0129054193000122},
  doi       = {10.1142/S0129054193000122},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijfcs/DiksGL93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KleinL93,
  author    = {Rolf Klein and
               Andrzej Lingas},
  title     = {A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram
               of a Convex Polygon},
  booktitle = {Proceedings of the 5th Canadian Conference on Computational Geometry,
               Waterloo, Ontario, Canada, August 1993},
  pages     = {370--374},
  year      = {1993},
  crossref  = {DBLP:conf/cccg/1993},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/KleinL93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KleinL93,
  author    = {Rolf Klein and
               Andrzej Lingas},
  title     = {A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram
               of a Simple Polygon},
  booktitle = {Proceedings of the Ninth Annual Symposium on Computational GeometrySan
               Diego, CA, USA, May 19-21, 1993},
  pages     = {124--132},
  year      = {1993},
  crossref  = {DBLP:conf/compgeom/1993},
  url       = {https://doi.org/10.1145/160985.161008},
  doi       = {10.1145/160985.161008},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/KleinL93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/LingasMS93,
  author    = {Andrzej Lingas and
               Anil Maheshwari and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Parallel Algorithms for Rectilinear Link Distance Problems},
  booktitle = {The Seventh International Parallel Processing Symposium, Proceedings,
               Newport Beach, California, USA, April 13-16, 1993.},
  pages     = {65--72},
  year      = {1993},
  crossref  = {DBLP:conf/ipps/1993},
  url       = {https://doi.org/10.1109/IPPS.1993.262857},
  doi       = {10.1109/IPPS.1993.262857},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ipps/LingasMS93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DessmarkJL93,
  author    = {Anders Dessmark and
               Klaus Jansen and
               Andrzej Lingas},
  title     = {The Maximum k-Dependent and f-Dependent Set Problem},
  booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
               Hong Kong, December 15-17, 1993, Proceedings},
  pages     = {88--98},
  year      = {1993},
  crossref  = {DBLP:conf/isaac/1993},
  url       = {https://doi.org/10.1007/3-540-57568-5\_238},
  doi       = {10.1007/3-540-57568-5\_238},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/DessmarkJL93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DessmarkLM93,
  author    = {Anders Dessmark and
               Andrzej Lingas and
               Anil Maheshwari},
  title     = {Multi-List Ranking: Complexity and Applications},
  booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
               Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
  pages     = {306--316},
  year      = {1993},
  crossref  = {DBLP:conf/stacs/1993},
  url       = {https://doi.org/10.1007/3-540-56503-5\_31},
  doi       = {10.1007/3-540-56503-5\_31},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/DessmarkLM93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/1993,
  editor    = {Andrzej Lingas and
               Rolf G. Karlsson and
               Svante Carlsson},
  title     = {Automata, Languages and Programming, 20nd International Colloquium,
               ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {700},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-56939-1},
  doi       = {10.1007/3-540-56939-1},
  isbn      = {3-540-56939-1},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/1993},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevcopoulosL92,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {There Are Planar Graphs Almost as Good as the Complete Graphs and
               Almost as Cheap as Minimum Spanning Trees},
  journal   = {Algorithmica},
  volume    = {8},
  number    = {3},
  pages     = {251--256},
  year      = {1992},
  url       = {https://doi.org/10.1007/BF01758846},
  doi       = {10.1007/BF01758846},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/LevcopoulosL92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LevcopoulosL92,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Fast Algorithms for Greedy Triangulation},
  journal   = {{BIT}},
  volume    = {32},
  number    = {2},
  pages     = {280--296},
  year      = {1992},
  timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/bit/LevcopoulosL92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DjidjevLS92,
  author    = {Hristo Djidjev and
               Andrzej Lingas and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {An O(n log n) Algorithm for Computing the Link Center of a Simple
               Polygon},
  journal   = {Discrete {\&} Computational Geometry},
  volume    = {8},
  pages     = {131--152},
  year      = {1992},
  url       = {https://doi.org/10.1007/BF02293040},
  doi       = {10.1007/BF02293040},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/DjidjevLS92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KleinL92,
  author    = {Rolf Klein and
               Andrzej Lingas},
  title     = {Manhattonian Proximity in a Simple Polygon},
  booktitle = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
               Berlin, Germany, June 10-12, 1992},
  pages     = {312--319},
  year      = {1992},
  crossref  = {DBLP:conf/compgeom/1992},
  url       = {https://doi.org/10.1145/142675.142738},
  doi       = {10.1145/142675.142738},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/KleinL92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LevcopoulosL92,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {C-sensitive Triangulations Approximate the MinMax Length Triangulation},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               12th Conference, New Delhi, India, December 18-20, 1992, Proceedings},
  pages     = {104--115},
  year      = {1992},
  crossref  = {DBLP:conf/fsttcs/1992},
  url       = {https://doi.org/10.1007/3-540-56287-7\_98},
  doi       = {10.1007/3-540-56287-7\_98},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/LevcopoulosL92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JenningsL92,
  author    = {Esther Jennings and
               Andrzej Lingas},
  title     = {On the Relationship among Constrained Geometric Structures},
  booktitle = {Algorithms and Computation, Third International Symposium, {ISAAC}
               '92, Nagoya, Japan, December 16-18, 1992, Proceedings},
  pages     = {289--298},
  year      = {1992},
  crossref  = {DBLP:conf/isaac/1992},
  url       = {https://doi.org/10.1007/3-540-56279-6\_82},
  doi       = {10.1007/3-540-56279-6\_82},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/JenningsL92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GarridoJLR92,
  author    = {Oscar Garrido and
               Stefan Jarominek and
               Andrzej Lingas and
               Wojciech Rytter},
  title     = {A Simple Randomized Parallel Algorithm for Maximal \emph{f}-Matching},
  booktitle = {{LATIN} '92, 1st Latin American Symposium on Theoretical Informatics,
               S{\~{a}}o Paulo, Brazil, April 6-10, 1992, Proceedings},
  pages     = {165--176},
  year      = {1992},
  crossref  = {DBLP:conf/latin/1992},
  url       = {https://doi.org/10.1007/BFb0023827},
  doi       = {10.1007/BFb0023827},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/GarridoJLR92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lingas91,
  author    = {Andrzej Lingas},
  title     = {An Unfeasible Matching Problem},
  journal   = {{BIT}},
  volume    = {31},
  number    = {4},
  pages     = {591--597},
  year      = {1991},
  timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/bit/Lingas91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lingas91,
  author    = {Andrzej Lingas},
  title     = {Bit Complexity of Matrix Products},
  journal   = {Inf. Process. Lett.},
  volume    = {38},
  number    = {5},
  pages     = {237--242},
  year      = {1991},
  url       = {https://doi.org/10.1016/0020-0190(91)90065-P},
  doi       = {10.1016/0020-0190(91)90065-P},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/Lingas91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icci/LevcopoulosL91,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Greedy Triangulation Approximates the Optimum and Can Be Implemented
               in Linear Time in the Average Case},
  booktitle = {Advances in Computing and Information - ICCI'91, International Conference
               on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings},
  pages     = {139--148},
  year      = {1991},
  crossref  = {DBLP:conf/icci/1991},
  url       = {https://doi.org/10.1007/3-540-54029-6\_163},
  doi       = {10.1007/3-540-54029-6\_163},
  timestamp = {Sun, 04 Jun 2017 10:10:23 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icci/LevcopoulosL91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/JenningsLM91,
  author    = {Esther Jennings and
               Andrzej Lingas and
               Lenka Motyckova},
  title     = {Dynamic Detection of Forest of Tree-Connected Meshes},
  booktitle = {Proceedings of the International Conference on Parallel Processing,
               {ICPP} '91, Austin, Texas, USA, August 1991. Volume {III:} Algorithms
               and Applications.},
  pages     = {300--301},
  year      = {1991},
  crossref  = {DBLP:conf/icpp/1991-3},
  timestamp = {Mon, 28 Jul 2014 17:06:01 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icpp/JenningsLM91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isa/DiksGL91,
  author    = {Krzysztof Diks and
               Oscar Garrido and
               Andrzej Lingas},
  title     = {Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal
               f-Matchings},
  booktitle = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei,
               Republic of China, December 16-18, 1991, Proceedings},
  pages     = {385--395},
  year      = {1991},
  crossref  = {DBLP:conf/isa/1991},
  url       = {https://doi.org/10.1007/3-540-54945-5\_82},
  doi       = {10.1007/3-540-54945-5\_82},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isa/DiksGL91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DjidjevL91,
  author    = {Hristo Djidjev and
               Andrzej Lingas},
  title     = {On Computing the Voronoi Diagram for Restricted Planar Figures},
  booktitle = {Algorithms and Data Structures, 2nd Workshop {WADS} '91, Ottawa, Canada,
               August 14-16, 1991, Proceedings},
  pages     = {54--64},
  year      = {1991},
  crossref  = {DBLP:conf/wads/1991},
  url       = {https://doi.org/10.1007/BFb0028250},
  doi       = {10.1007/BFb0028250},
  timestamp = {Sat, 20 May 2017 15:32:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/DjidjevL91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Lingas90,
  author    = {Andrzej Lingas},
  title     = {A Note on a Parallel Heuristic for Minimum},
  journal   = {Bulletin of the {EATCS}},
  volume    = {42},
  pages     = {174--177},
  year      = {1990},
  timestamp = {Mon, 07 Jul 2003 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eatcs/Lingas90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LevcopoulosLPR90,
  author    = {Christos Levcopoulos and
               Andrzej Lingas and
               Ola Petersson and
               Wojciech Rytter},
  title     = {Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar
               Graphs},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings},
  pages     = {204--214},
  year      = {1990},
  crossref  = {DBLP:conf/fsttcs/1990},
  url       = {https://doi.org/10.1007/3-540-53487-3\_45},
  doi       = {10.1007/3-540-53487-3\_45},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/LevcopoulosLPR90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigal/Lingas90,
  author    = {Andrzej Lingas},
  title     = {Efficient Parallel Algorithms for Path Problems in Planar Directed
               Graphs},
  booktitle = {Algorithms, International Symposium {SIGAL} '90, Tokyo, Japan, August
               16-18, 1990, Proceedings},
  pages     = {447--457},
  year      = {1990},
  crossref  = {DBLP:conf/sigal/1990},
  url       = {https://doi.org/10.1007/3-540-52921-7\_94},
  doi       = {10.1007/3-540-52921-7\_94},
  timestamp = {Fri, 19 May 2017 13:10:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sigal/Lingas90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosL90,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Fast Algorithms for Greedy Triangulation},
  booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
               Norway, July 11-14, 1990, Proceedings},
  pages     = {238--250},
  year      = {1990},
  crossref  = {DBLP:conf/swat/1990},
  url       = {https://doi.org/10.1007/3-540-52846-6\_93},
  doi       = {10.1007/3-540-52846-6\_93},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/LevcopoulosL90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LingasK89,
  author    = {Andrzej Lingas and
               Marek Karpinski},
  title     = {Subtree Isomorphism is {NC} Reducible to Bipartite Perfect Matching},
  journal   = {Inf. Process. Lett.},
  volume    = {30},
  number    = {1},
  pages     = {27--32},
  year      = {1989},
  url       = {https://doi.org/10.1016/0020-0190(89)90170-1},
  doi       = {10.1016/0020-0190(89)90170-1},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/LingasK89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lingas89,
  author    = {Andrzej Lingas},
  title     = {Voronoi Diagrams with Barriers and the Shortest Diagonal Problem},
  journal   = {Inf. Process. Lett.},
  volume    = {32},
  number    = {4},
  pages     = {191--198},
  year      = {1989},
  url       = {https://doi.org/10.1016/0020-0190(89)90043-4},
  doi       = {10.1016/0020-0190(89)90043-4},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/Lingas89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lingas89,
  author    = {Andrzej Lingas},
  title     = {Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time},
  journal   = {Theor. Comput. Sci.},
  volume    = {63},
  number    = {3},
  pages     = {295--302},
  year      = {1989},
  url       = {https://doi.org/10.1016/0304-3975(89)90011-X},
  doi       = {10.1016/0304-3975(89)90011-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/Lingas89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LevcopoulosLS89,
  author    = {Christos Levcopoulos and
               Andrzej Lingas and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation
               Problems},
  journal   = {Theor. Comput. Sci.},
  volume    = {66},
  number    = {2},
  pages     = {181--203},
  year      = {1989},
  url       = {https://doi.org/10.1016/0304-3975(89)90134-5},
  doi       = {10.1016/0304-3975(89)90134-5},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/LevcopoulosLS89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LingasP89,
  author    = {Andrzej Lingas and
               Andrzej Proskurowski},
  title     = {On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph
               Isomorphism Problem for Classes of Planar Graphs},
  journal   = {Theor. Comput. Sci.},
  volume    = {68},
  number    = {2},
  pages     = {155--173},
  year      = {1989},
  url       = {https://doi.org/10.1016/0304-3975(89)90127-8},
  doi       = {10.1016/0304-3975(89)90127-8},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/LingasP89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oa/LevcopoulosL89,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Ther Are Planar Graphs Almost as Good as the Complete Graphs and as
               Short as Minimum Spanning Trees},
  booktitle = {Optimal Algorithms, International Symposium, Varna, Bulgaria, May
               29 - June 2, 1989, Proceedings},
  pages     = {9--13},
  year      = {1989},
  crossref  = {DBLP:conf/oa/1989},
  url       = {https://doi.org/10.1007/3-540-51859-2\_2},
  doi       = {10.1007/3-540-51859-2\_2},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/oa/LevcopoulosL89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DjidjevLS89,
  author    = {Hristo Djidjev and
               Andrzej Lingas and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon},
  booktitle = {{STACS} 89, 6th Annual Symposium on Theoretical Aspects of Computer
               Science, Paderborn, FRG, February 16-18, 1989, Proceedings},
  pages     = {96--107},
  year      = {1989},
  crossref  = {DBLP:conf/stacs/1989},
  url       = {https://doi.org/10.1007/BFb0028976},
  doi       = {10.1007/BFb0028976},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/DjidjevLS89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vc/DeanLS88,
  author    = {James A. Dean and
               Andrzej Lingas and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Recognizing polygons, or how to spy},
  journal   = {The Visual Computer},
  volume    = {3},
  number    = {6},
  pages     = {344--355},
  year      = {1988},
  url       = {https://doi.org/10.1007/BF01901192},
  doi       = {10.1007/BF01901192},
  timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/vc/DeanLS88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LingasS88,
  author    = {Andrzej Lingas and
               Maciej M. Syslo},
  title     = {A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected
               Series-Parallel Graphs},
  booktitle = {Automata, Languages and Programming, 15th International Colloquium,
               ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings},
  pages     = {394--409},
  year      = {1988},
  crossref  = {DBLP:conf/icalp/1988},
  url       = {https://doi.org/10.1007/3-540-19488-6\_130},
  doi       = {10.1007/3-540-19488-6\_130},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/LingasS88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosKL88,
  author    = {Christos Levcopoulos and
               Jyrki Katajainen and
               Andrzej Lingas},
  title     = {An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams},
  booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
               Sweden, July 5-8, 1988, Proceedings},
  pages     = {190--198},
  year      = {1988},
  crossref  = {DBLP:conf/swat/1988},
  url       = {https://doi.org/10.1007/3-540-19487-8\_21},
  doi       = {10.1007/3-540-19487-8\_21},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/LevcopoulosKL88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Lingas88,
  author    = {Andrzej Lingas},
  title     = {Greedy Triangulation acn be Efficiently Implemented in the Average
               Case (Extended Abstract)},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 14th International Workshop,
               {WG} '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings},
  pages     = {253--261},
  year      = {1988},
  crossref  = {DBLP:conf/wg/1988},
  url       = {https://doi.org/10.1007/3-540-50728-0\_48},
  doi       = {10.1007/3-540-50728-0\_48},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/Lingas88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1988,
  editor    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
               Sweden, July 5-8, 1988, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {318},
  publisher = {Springer},
  year      = {1988},
  url       = {https://doi.org/10.1007/3-540-19487-8},
  doi       = {10.1007/3-540-19487-8},
  isbn      = {3-540-19487-8},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/1988},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevcopoulosL87,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {On Approximation Behavior of the Greedy Triangulation for Convex Polygons},
  journal   = {Algorithmica},
  volume    = {2},
  pages     = {15--193},
  year      = {1987},
  url       = {https://doi.org/10.1007/BF01840358},
  doi       = {10.1007/BF01840358},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/LevcopoulosL87},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LingasLS87,
  author    = {Andrzej Lingas and
               Christos Levcopoulos and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Algorithms for Minimum Length Partitions of Polygons},
  journal   = {{BIT}},
  volume    = {27},
  number    = {4},
  pages     = {474--479},
  year      = {1987},
  timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/bit/LingasLS87},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LingasP87,
  author    = {Andrzej Lingas and
               Andrzej Proskurowski},
  title     = {Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph
               Isomorphism Problem for Classes of Planat Graphs},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               Seventh Conference, Pune, India, December 17-19, 1987, Proceedings},
  pages     = {79--94},
  year      = {1987},
  crossref  = {DBLP:conf/fsttcs/1987},
  url       = {https://doi.org/10.1007/3-540-18625-5\_44},
  doi       = {10.1007/3-540-18625-5\_44},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/LingasP87},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LevcopoulosLS87,
  author    = {Christos Levcopoulos and
               Andrzej Lingas and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations
               (Extended Abstract)},
  booktitle = {Automata, Languages and Programming, 14th International Colloquium,
               ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
  pages     = {376--385},
  year      = {1987},
  crossref  = {DBLP:conf/icalp/1987},
  url       = {https://doi.org/10.1007/3-540-18088-5\_32},
  doi       = {10.1007/3-540-18088-5\_32},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/LevcopoulosLS87},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Lingas86,
  author    = {Andrzej Lingas},
  title     = {On Approximation Behavior and Implementation of the Greedy Triangulation
               for Convex Planar Point Sets},
  booktitle = {Proceedings of the Second Annual {ACM} {SIGACT/SIGGRAPH} Symposium
               on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986},
  pages     = {72--79},
  year      = {1986},
  crossref  = {DBLP:conf/compgeom/1986},
  url       = {https://doi.org/10.1145/10515.10523},
  doi       = {10.1145/10515.10523},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/Lingas86},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lingas86,
  author    = {Andrzej Lingas},
  title     = {Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time},
  booktitle = {{STACS} 86, 3rd Annual Symposium on Theoretical Aspects of Computer
               Science, Orsay, France, January 16-18, 1986, Proceedings},
  pages     = {98--103},
  year      = {1986},
  crossref  = {DBLP:conf/stacs/1986},
  url       = {https://doi.org/10.1007/3-540-16078-7\_68},
  doi       = {10.1007/3-540-16078-7\_68},
  timestamp = {Fri, 19 May 2017 12:26:19 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/Lingas86},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Lingas85,
  author    = {Andrzej Lingas},
  title     = {On partitioning polygons},
  booktitle = {Proceedings of the First Annual Symposium on Computational Geometry,
               Baltimore, Maryland, USA, June 5-7, 1985},
  pages     = {288--295},
  year      = {1985},
  crossref  = {DBLP:conf/compgeom/1985},
  url       = {https://doi.org/10.1145/323233.323270},
  doi       = {10.1145/323233.323270},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/Lingas85},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LevcopoulosL84,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Bounds on the Length of Convex Partitions of Polygons},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings},
  pages     = {279--295},
  year      = {1984},
  crossref  = {DBLP:conf/fsttcs/1984},
  url       = {https://doi.org/10.1007/3-540-13883-8\_78},
  doi       = {10.1007/3-540-13883-8\_78},
  timestamp = {Fri, 19 May 2017 12:26:23 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/LevcopoulosL84},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LevcopoulosL84,
  author    = {Christos Levcopoulos and
               Andrzej Lingas},
  title     = {Covering Polygons with Minimum Number of Rectangles},
  booktitle = {{STACS} 84, Symposium of Theoretical Aspects of Computer Science,
               Paris, France, 11-13 April, 1984, Proceedings},
  pages     = {63--72},
  year      = {1984},
  crossref  = {DBLP:conf/stacs/1984},
  url       = {https://doi.org/10.1007/3-540-12920-0\_6},
  doi       = {10.1007/3-540-12920-0\_6},
  timestamp = {Fri, 19 May 2017 12:26:19 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/LevcopoulosL84},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/Lingas83,
  author    = {Andrzej Lingas},
  title     = {An Application of Maximum Bipartite C-Matching to Subtree Isomorphism},
  booktitle = {CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila,
               Italy, March 9-11, 1983, Proceedings},
  pages     = {284--299},
  year      = {1983},
  crossref  = {DBLP:conf/caap/1983},
  url       = {https://doi.org/10.1007/3-540-12727-5\_17},
  doi       = {10.1007/3-540-12727-5\_17},
  timestamp = {Fri, 19 May 2017 12:26:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/caap/Lingas83},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Lingas83,
  author    = {Andrzej Lingas},
  title     = {The Greedy and Delauney Triangulations are not Bad in the Average
               Case and Minimum Weight Geometric Triangulation of Multi-Connected
               Polygons is NP-Complete},
  booktitle = {Fundamentals of Computation Theory, Proceedings of the 1983 International
               FCT-Conference, Borgholm, Sweden, August 21-27, 1983},
  pages     = {270--284},
  year      = {1983},
  crossref  = {DBLP:conf/fct/1983},
  url       = {https://doi.org/10.1007/3-540-12689-9\_110},
  doi       = {10.1007/3-540-12689-9\_110},
  timestamp = {Fri, 19 May 2017 12:26:22 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fct/Lingas83},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcs/Lingas83,
  author    = {Andrzej Lingas},
  title     = {Heuristics for minimum edge length rectangular partitions of rectilinear
               figures},
  booktitle = {Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany,
               January 5-7, 1983, Proceedings},
  pages     = {199--210},
  year      = {1983},
  crossref  = {DBLP:conf/tcs/1983},
  url       = {https://doi.org/10.1007/BFb0009645},
  doi       = {10.1007/BFb0009645},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tcs/Lingas83},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lingas82,
  author    = {Andrzej Lingas},
  title     = {The Power of Non-Rectilinear Holes},
  booktitle = {Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark,
               July 12-16, 1982, Proceedings},
  pages     = {369--383},
  year      = {1982},
  crossref  = {DBLP:conf/icalp/1982},
  url       = {https://doi.org/10.1007/BFb0012784},
  doi       = {10.1007/BFb0012784},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/Lingas82},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/Lingas81,
  author    = {Andrzej Lingas},
  title     = {Certain Algorithms for Subgraph Isomorphism Problems},
  booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa,
               Italy, March 5-7, 1981, Proceedings},
  pages     = {290--307},
  year      = {1981},
  crossref  = {DBLP:conf/caap/1981},
  url       = {https://doi.org/10.1007/3-540-10828-9\_70},
  doi       = {10.1007/3-540-10828-9\_70},
  timestamp = {Fri, 19 May 2017 12:26:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/caap/Lingas81},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Lingas79,
  author    = {Andrzej Lingas},
  title     = {The complexity of distributive computations},
  booktitle = {{FCT}},
  pages     = {262--268},
  year      = {1979},
  timestamp = {Thu, 25 Jul 2002 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fct/Lingas79},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lingas78,
  author    = {Andrzej Lingas},
  title     = {A {PSPACE} Complete Problem Related to a Pebble Game},
  booktitle = {Automata, Languages and Programming, Fifth Colloquium, Udine, Italy,
               July 17-21, 1978, Proceedings},
  pages     = {300--321},
  year      = {1978},
  crossref  = {DBLP:conf/icalp/1978},
  url       = {https://doi.org/10.1007/3-540-08860-1\_22},
  doi       = {10.1007/3-540-08860-1\_22},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/Lingas78},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/faw/2019,
  editor    = {Yijia Chen and
               Xiaotie Deng and
               Mei Lu},
  title     = {Frontiers in Algorithmics - 13th International Workshop, {FAW} 2019,
               Sanya, China, April 29 - May 3, 2019, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11458},
  publisher = {Springer},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-18126-0},
  doi       = {10.1007/978-3-030-18126-0},
  isbn      = {978-3-030-18125-3},
  timestamp = {Thu, 18 Apr 2019 17:11:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/faw/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2019,
  editor    = {Rolf Niedermeier and
               Christophe Paul},
  title     = {36th International Symposium on Theoretical Aspects of Computer Science,
               {STACS} 2019, March 13-16, 2019, Berlin, Germany},
  series    = {LIPIcs},
  volume    = {126},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2019},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-100-9},
  isbn      = {978-3-95977-100-9},
  timestamp = {Tue, 12 Mar 2019 17:06:16 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2018,
  editor    = {Rocco A. Servedio},
  title     = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
               2018, San Diego, CA, {USA}},
  series    = {LIPIcs},
  volume    = {102},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-069-9},
  isbn      = {978-3-95977-069-9},
  timestamp = {Mon, 04 Jun 2018 18:10:04 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fct/2017,
  editor    = {Ralf Klasing and
               Marc Zeitoun},
  title     = {Fundamentals of Computation Theory - 21st International Symposium,
               {FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10472},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-662-55751-8},
  doi       = {10.1007/978-3-662-55751-8},
  isbn      = {978-3-662-55750-1},
  timestamp = {Tue, 29 Aug 2017 15:14:25 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fct/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/recomb/2017,
  editor    = {S{\"{u}}leyman Cenk Sahinalp},
  title     = {Research in Computational Molecular Biology - 21st Annual International
               Conference, {RECOMB} 2017, Hong Kong, China, May 3-7, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10229},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-56970-3},
  doi       = {10.1007/978-3-319-56970-3},
  isbn      = {978-3-319-56969-7},
  timestamp = {Thu, 25 May 2017 00:42:22 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/recomb/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sofsem/2017,
  editor    = {Bernhard Steffen and
               Christel Baier and
               Mark van den Brand and
               Johann Eder and
               Mike Hinchey and
               Tiziana Margaria},
  title     = {{SOFSEM} 2017: Theory and Practice of Computer Science - 43rd International
               Conference on Current Trends in Theory and Practice of Computer Science,
               Limerick, Ireland, January 16-20, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10139},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-51963-0},
  doi       = {10.1007/978-3-319-51963-0},
  isbn      = {978-3-319-51962-3},
  timestamp = {Tue, 23 May 2017 01:08:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sofsem/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2017,
  editor    = {T. V. Gopal and
               Gerhard J{\"{a}}ger and
               Silvia Steila},
  title     = {Theory and Applications of Models of Computation - 14th Annual Conference,
               {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10185},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-55911-7},
  doi       = {10.1007/978-3-319-55911-7},
  isbn      = {978-3-319-55910-0},
  timestamp = {Sun, 21 May 2017 00:19:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/walcom/2017,
  editor    = {Sheung{-}Hung Poon and
               Md. Saidur Rahman and
               Hsu{-}Chun Yen},
  title     = {{WALCOM:} Algorithms and Computation, 11th International Conference
               and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017,
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10167},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-53925-6},
  doi       = {10.1007/978-3-319-53925-6},
  isbn      = {978-3-319-53924-9},
  timestamp = {Tue, 23 May 2017 01:12:09 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/walcom/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoa/2015,
  editor    = {Zaixin Lu and
               Donghyun Kim and
               Weili Wu and
               Wei Li and
               Ding{-}Zhu Du},
  title     = {Combinatorial Optimization and Applications - 9th International Conference,
               {COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9486},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-26626-8},
  doi       = {10.1007/978-3-319-26626-8},
  isbn      = {978-3-319-26625-1},
  timestamp = {Wed, 17 May 2017 14:24:37 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoa/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2015,
  editor    = {Ferdinando Cicalese and
               Ely Porat and
               Ugo Vaccaro},
  title     = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
               Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9133},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-19929-0},
  doi       = {10.1007/978-3-319-19929-0},
  isbn      = {978-3-319-19928-3},
  timestamp = {Fri, 26 May 2017 00:50:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/2015},
  bibsource = {dblp computer science bibliography, https://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 = {Fri, 02 Nov 2018 09:50:27 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2015-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fun/2014,
  editor    = {Alfredo Ferro and
               Fabrizio Luccio and
               Peter Widmayer},
  title     = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari
               Island, Sicily, Italy, July 1-3, 2014. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8496},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-07890-8},
  doi       = {10.1007/978-3-319-07890-8},
  isbn      = {978-3-319-07889-2},
  timestamp = {Fri, 26 May 2017 00:48:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fun/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2014,
  editor    = {Hee{-}Kap Ahn and
               Chan{-}Su Shin},
  title     = {Algorithms and Computation - 25th International Symposium, {ISAAC}
               2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8889},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-13075-0},
  doi       = {10.1007/978-3-319-13075-0},
  isbn      = {978-3-319-13074-3},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2014,
  editor    = {Alberto Pardo and
               Alfredo Viola},
  title     = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
               Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8392},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-642-54423-1},
  doi       = {10.1007/978-3-642-54423-1},
  isbn      = {978-3-642-54422-4},
  timestamp = {Tue, 23 May 2017 01:11:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2013,
  editor    = {Leizhen Cai and
               Siu{-}Wing Cheng and
               Tak Wah Lam},
  title     = {Algorithms and Computation - 24th International Symposium, {ISAAC}
               2013, Hong Kong, China, December 16-18, 2013, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8283},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-45030-3},
  doi       = {10.1007/978-3-642-45030-3},
  isbn      = {978-3-642-45029-7},
  timestamp = {Wed, 14 Nov 2018 10:57:25 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/lssc/2013,
  editor    = {Ivan Lirkov and
               Svetozar Margenov and
               Jerzy Wasniewski},
  title     = {Large-Scale Scientific Computing - 9th International Conference, {LSSC}
               2013, Sozopol, Bulgaria, June 3-7, 2013. Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {8353},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-43880-0},
  doi       = {10.1007/978-3-662-43880-0},
  isbn      = {978-3-662-43879-4},
  timestamp = {Sun, 04 Jun 2017 10:07:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lssc/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2012,
  editor    = {Joachim Gudmundsson and
               Juli{\'{a}}n Mestre and
               Taso Viglas},
  title     = {Computing and Combinatorics - 18th Annual International Conference,
               {COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7434},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32241-9},
  doi       = {10.1007/978-3-642-32241-9},
  isbn      = {978-3-642-32240-2},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2012,
  editor    = {Juha K{\"{a}}rkk{\"{a}}inen and
               Jens Stoye},
  title     = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
               Helsinki, Finland, July 3-5, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7354},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-31265-6},
  doi       = {10.1007/978-3-642-31265-6},
  isbn      = {978-3-642-31264-9},
  timestamp = {Fri, 26 May 2017 00:50:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/europar/2012,
  editor    = {Christos Kaklamanis and
               Theodore S. Papatheodorou and
               Paul G. Spirakis},
  title     = {Euro-Par 2012 Parallel Processing - 18th International Conference,
               Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7484},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32820-6},
  doi       = {10.1007/978-3-642-32820-6},
  isbn      = {978-3-642-32819-0},
  timestamp = {Wed, 24 May 2017 08:27:49 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/europar/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sofsem/2012,
  editor    = {M{\'{a}}ria Bielikov{\'{a}} and
               Gerhard Friedrich and
               Georg Gottlob and
               Stefan Katzenbeisser and
               Gy{\"{o}}rgy Tur{\'{a}}n},
  title     = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
               on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
               Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7147},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-27660-6},
  doi       = {10.1007/978-3-642-27660-6},
  isbn      = {978-3-642-27659-0},
  timestamp = {Tue, 23 May 2017 01:08:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sofsem/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cats/2011,
  editor    = {Alex Potanin and
               Taso Viglas},
  title     = {Seventeenth Computing: The Australasian Theory Symposium, {CATS} 2011,
               Perth, Australia, January 2011},
  series    = {{CRPIT}},
  volume    = {119},
  publisher = {Australian Computer Society},
  year      = {2011},
  url       = {http://crpit.com/Vol119.html},
  isbn      = {978-1-920682-98-9},
  timestamp = {Wed, 17 Apr 2013 21:02:40 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cats/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2011-1,
  editor    = {Luca Aceto and
               Monika Henzinger and
               Jir{\'{\i}} Sgall},
  title     = {Automata, Languages and Programming - 38th International Colloquium,
               {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6755},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22006-7},
  doi       = {10.1007/978-3-642-22006-7},
  isbn      = {978-3-642-22005-0},
  timestamp = {Thu, 15 Jun 2017 21:39:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2011-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/lata/2011,
  editor    = {Adrian{-}Horia Dediu and
               Shunsuke Inenaga and
               Carlos Mart{\'{\i}}n{-}Vide},
  title     = {Language and Automata Theory and Applications - 5th International
               Conference, {LATA} 2011, Tarragona, Spain, May 26-31, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6638},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-21254-3},
  doi       = {10.1007/978-3-642-21254-3},
  isbn      = {978-3-642-21253-6},
  timestamp = {Wed, 24 May 2017 08:29:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lata/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2011,
  editor    = {Dana Randall},
  title     = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  publisher = {{SIAM}},
  year      = {2011},
  url       = {https://doi.org/10.1137/1.9781611973082},
  doi       = {10.1137/1.9781611973082},
  isbn      = {978-0-89871-993-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2011,
  editor    = {Mitsunori Ogihara and
               Jun Tarui},
  title     = {Theory and Applications of Models of Computation - 8th Annual Conference,
               {TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6648},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-20877-5},
  doi       = {10.1007/978-3-642-20877-5},
  isbn      = {978-3-642-20876-8},
  timestamp = {Sun, 21 May 2017 00:19:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2010,
  editor    = {My T. Thai and
               Sartaj Sahni},
  title     = {Computing and Combinatorics, 16th Annual International Conference,
               {COCOON} 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6196},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14031-0},
  doi       = {10.1007/978-3-642-14031-0},
  isbn      = {978-3-642-14030-3},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sofsem/2010,
  editor    = {Jan van Leeuwen and
               Anca Muscholl and
               David Peleg and
               Jaroslav Pokorn{\'{y}} and
               Bernhard Rumpe},
  title     = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
               on Current Trends in Theory and Practice of Computer Science, Spindleruv
               Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5901},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-11266-9},
  doi       = {10.1007/978-3-642-11266-9},
  isbn      = {978-3-642-11265-2},
  timestamp = {Tue, 23 May 2017 01:08:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sofsem/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wabi/2010,
  editor    = {Vincent Moulton and
               Mona Singh},
  title     = {Algorithms in Bioinformatics, 10th International Workshop, {WABI}
               2010, Liverpool, UK, September 6-8, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6293},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-15294-8},
  doi       = {10.1007/978-3-642-15294-8},
  isbn      = {978-3-642-15293-1},
  timestamp = {Tue, 30 Oct 2018 10:59:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/wabi/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2009,
  editor    = {Amos Fiat and
               Peter Sanders},
  title     = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
               Denmark, September 7-9, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5757},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-04128-0},
  doi       = {10.1007/978-3-642-04128-0},
  isbn      = {978-3-642-04127-3},
  timestamp = {Fri, 26 May 2017 00:49:36 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2009,
  editor    = {Yingfei Dong and
               Ding{-}Zhu Du and
               Oscar H. Ibarra},
  title     = {Algorithms and Computation, 20th International Symposium, {ISAAC}
               2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5878},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-10631-6},
  doi       = {10.1007/978-3-642-10631-6},
  isbn      = {978-3-642-10630-9},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/podc/2009,
  editor    = {Srikanta Tirthapura and
               Lorenzo Alvisi},
  title     = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed
               Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009},
  publisher = {{ACM}},
  year      = {2009},
  url       = {http://dl.acm.org/citation.cfm?id=1582716},
  isbn      = {978-1-60558-396-9},
  timestamp = {Wed, 23 May 2012 14:26:11 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/podc/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2009,
  editor    = {Frank K. H. A. Dehne and
               Marina L. Gavrilova and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Csaba D. T{\'{o}}th},
  title     = {Algorithms and Data Structures, 11th International Symposium, {WADS}
               2009, Banff, Canada, August 21-23, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5664},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-03367-4},
  doi       = {10.1007/978-3-642-03367-4},
  isbn      = {978-3-642-03366-7},
  timestamp = {Sun, 21 May 2017 00:16:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2008,
  editor    = {Eduardo Sany Laber and
               Claudson F. Bornstein and
               Loana Tito Nogueira and
               Lu{\'{e}}rbio Faria},
  title     = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
               B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4957},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-78773-0},
  doi       = {10.1007/978-3-540-78773-0},
  isbn      = {978-3-540-78772-3},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2008,
  editor    = {Joachim Gudmundsson},
  title     = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
               Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5124},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-69903-3},
  doi       = {10.1007/978-3-540-69903-3},
  isbn      = {978-3-540-69900-2},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/walcom/2008,
  editor    = {Shin{-}Ichi Nakano and
               Md. Saidur Rahman},
  title     = {{WALCOM:} Algorithms and Computation, Second International Workshop,
               {WALCOM} 2008, Dhaka, Bangladesh, February 7-8, 2008},
  series    = {Lecture Notes in Computer Science},
  volume    = {4921},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-77891-2},
  doi       = {10.1007/978-3-540-77891-2},
  isbn      = {978-3-540-77890-5},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/walcom/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wdag/2008,
  editor    = {Gadi Taubenfeld},
  title     = {Distributed Computing, 22nd International Symposium, {DISC} 2008,
               Arcachon, France, September 22-24, 2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5218},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-87779-0},
  doi       = {10.1007/978-3-540-87779-0},
  isbn      = {978-3-540-87778-3},
  timestamp = {Tue, 13 Jun 2017 10:37:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wdag/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:reference/algo/2008,
  editor    = {Ming{-}Yang Kao},
  title     = {Encyclopedia of Algorithms},
  publisher = {Springer},
  year      = {2008},
  isbn      = {978-0-387-30162-4},
  timestamp = {Fri, 25 Nov 2011 18:23:31 +0100},
  biburl    = {https://dblp.org/rec/bib/reference/algo/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aaim/2007,
  editor    = {Ming{-}Yang Kao and
               Xiang{-}Yang Li},
  title     = {Algorithmic Aspects in Information and Management, Third International
               Conference, {AAIM} 2007, Portland, OR, USA, June 6-8, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4508},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-72870-2},
  doi       = {10.1007/978-3-540-72870-2},
  isbn      = {978-3-540-72868-9},
  timestamp = {Fri, 27 Oct 2017 16:14:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/aaim/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2007,
  editor    = {Lars Arge and
               Michael Hoffmann and
               Emo Welzl},
  title     = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
               October 8-10, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4698},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-75520-3},
  doi       = {10.1007/978-3-540-75520-3},
  isbn      = {978-3-540-75519-7},
  timestamp = {Wed, 15 Nov 2017 16:12:49 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/esa/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2007,
  editor    = {Nikhil Bansal and
               Kirk Pruhs and
               Clifford Stein},
  title     = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
               2007},
  publisher = {{SIAM}},
  year      = {2007},
  url       = {http://dl.acm.org/citation.cfm?id=1283383},
  isbn      = {978-0-898716-24-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2007,
  editor    = {Jin{-}yi Cai and
               S. Barry Cooper and
               Hong Zhu},
  title     = {Theory and Applications of Models of Computation, 4th International
               Conference, {TAMC} 2007, Shanghai, China, May 22-25, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4484},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-72504-6},
  doi       = {10.1007/978-3-540-72504-6},
  isbn      = {978-3-540-72503-9},
  timestamp = {Sun, 21 May 2017 00:19:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:reference/crc/2007aam,
  editor    = {Teofilo F. Gonzalez},
  title     = {Handbook of Approximation Algorithms and Metaheuristics},
  publisher = {Chapman and Hall/CRC},
  year      = {2007},
  url       = {https://doi.org/10.1201/9781420010749},
  doi       = {10.1201/9781420010749},
  isbn      = {978-1-58488-550-4},
  timestamp = {Tue, 16 May 2017 14:02:19 +0200},
  biburl    = {https://dblp.org/rec/bib/reference/crc/2007aam},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/caan/2006,
  editor    = {Thomas Erlebach},
  title     = {Combinatorial and Algorithmic Aspects of Networking, Third Workshop,
               {CAAN} 2006, Chester, UK, July 2, 2006. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4235},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11922377},
  doi       = {10.1007/11922377},
  isbn      = {3-540-48822-7},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/caan/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cats/2006,
  editor    = {Joachim Gudmundsson and
               C. Barry Jay},
  title     = {Theory of Computing 2006, Proceedings of the Twelfth Computing: The
               Australasian Theory Symposium {(CATS2006).} Hobart, Tasmania, Australia,
               16-19 January 2006, Proceedings},
  series    = {{CRPIT}},
  volume    = {51},
  publisher = {Australian Computer Society},
  year      = {2006},
  isbn      = {1-920682-33-3},
  timestamp = {Fri, 13 Jun 2008 14:58:32 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cats/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cats/2005,
  editor    = {Mike D. Atkinson and
               Frank K. H. A. Dehne},
  title     = {Theory of Computing 2005, Eleventh {CATS} 2005, Computing: The Australasian
               Theory Symposium, Newcastle, NSW, Australia, January/February 2005},
  series    = {{CRPIT}},
  volume    = {41},
  publisher = {Australian Computer Society},
  year      = {2005},
  isbn      = {1-920682-23-6},
  timestamp = {Tue, 19 Apr 2005 14:19:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cats/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2005,
  editor    = {Lu{\'{\i}}s Caires and
               Giuseppe F. Italiano and
               Lu{\'{\i}}s Monteiro and
               Catuscia Palamidessi and
               Moti Yung},
  title     = {Automata, Languages and Programming, 32nd International Colloquium,
               {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3580},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11523468},
  doi       = {10.1007/11523468},
  isbn      = {3-540-27580-0},
  timestamp = {Wed, 14 Nov 2018 11:00:13 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2005,
  editor    = {Xiaotie Deng and
               Ding{-}Zhu Du},
  title     = {Algorithms and Computation, 16th International Symposium, {ISAAC}
               2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3827},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11602613},
  doi       = {10.1007/11602613},
  isbn      = {3-540-30935-7},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2005,
  editor    = {Frank K. H. A. Dehne and
               Alejandro L{\'{o}}pez{-}Ortiz and
               J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title     = {Algorithms and Data Structures, 9th International Workshop, {WADS}
               2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3608},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11534273},
  doi       = {10.1007/11534273},
  isbn      = {3-540-28101-0},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2004,
  editor    = {S{\"{u}}leyman Cenk Sahinalp and
               S. Muthukrishnan and
               Ugur Dogrus{\"{o}}z},
  title     = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
               Istanbul,Turkey, July 5-7, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3109},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b98377},
  doi       = {10.1007/b98377},
  isbn      = {3-540-22341-X},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2004,
  editor    = {Torben Hagerup and
               Jyrki Katajainen},
  title     = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
               Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3111},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b98413},
  doi       = {10.1007/b98413},
  isbn      = {3-540-22339-8},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2003,
  editor    = {Tandy J. Warnow and
               Binhai Zhu},
  title     = {Computing and Combinatorics, 9th Annual International Conference,
               {COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2697},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/3-540-45071-8},
  doi       = {10.1007/3-540-45071-8},
  isbn      = {3-540-40534-8},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2003,
  editor    = {Toshihide Ibaraki and
               Naoki Katoh and
               Hirotaka Ono},
  title     = {Algorithms and Computation, 14th International Symposium, {ISAAC}
               2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2906},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/b94771},
  doi       = {10.1007/b94771},
  isbn      = {3-540-20695-7},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2003,
  editor    = {Frank K. H. A. Dehne and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Michiel H. M. Smid},
  title     = {Algorithms and Data Structures, 8th International Workshop, {WADS}
               2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2748},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/b11837},
  doi       = {10.1007/b11837},
  isbn      = {3-540-40545-3},
  timestamp = {Mon, 29 May 2017 16:53:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2002,
  editor    = {Peter Widmayer and
               Francisco Triguero Ruiz and
               Rafael Morales Bueno and
               Matthew Hennessy and
               Stephan Eidenbenz and
               Ricardo Conejo},
  title     = {Automata, Languages and Programming, 29th International Colloquium,
               {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2380},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45465-9},
  doi       = {10.1007/3-540-45465-9},
  isbn      = {3-540-43864-5},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2002,
  editor    = {Prosenjit Bose and
               Pat Morin},
  title     = {Algorithms and Computation, 13th International Symposium, {ISAAC}
               2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2518},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-36136-7},
  doi       = {10.1007/3-540-36136-7},
  isbn      = {3-540-00142-5},
  timestamp = {Fri, 02 Nov 2018 09:43:26 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2002,
  editor    = {David Eppstein},
  title     = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381},
  isbn      = {0-89871-513-X},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2002,
  editor    = {Martti Penttonen and
               Erik Meineche Schmidt},
  title     = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
               Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2368},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45471-3},
  doi       = {10.1007/3-540-45471-3},
  isbn      = {3-540-43866-1},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2001,
  editor    = {Amihood Amir and
               Gad M. Landau},
  title     = {Combinatorial Pattern Matching, 12th Annual Symposium, {CPM} 2001
               Jerusalem, Israel, July 1-4, 2001 Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2089},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-48194-X},
  doi       = {10.1007/3-540-48194-X},
  isbn      = {3-540-42271-4},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dialm/2001,
  title     = {Proceedings of the 5th International Workshop on Discrete Algorithms
               and Methods for Mobile Computing and Communications {(DIAL-M} 2001),
               Rome, Italy, July 21, 2001},
  publisher = {{ACM}},
  year      = {2001},
  timestamp = {Thu, 02 Oct 2003 10:19:35 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/dialm/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2001,
  editor    = {Friedhelm {Meyer auf der Heide}},
  title     = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
               August 28-31, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2161},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44676-1},
  doi       = {10.1007/3-540-44676-1},
  isbn      = {3-540-42493-8},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fct/2001,
  editor    = {Rusins Freivalds},
  title     = {Fundamentals of Computation Theory, 13th International Symposium,
               {FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2138},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44669-9},
  doi       = {10.1007/3-540-44669-9},
  isbn      = {3-540-42487-3},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fct/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/podc/2001,
  editor    = {Ajay D. Kshemkalyani and
               Nir Shavit},
  title     = {Proceedings of the Twentieth Annual {ACM} Symposium on Principles
               of Distributed Computing, {PODC} 2001, Newport, Rhode Island, USA,
               August 26-29, 2001},
  publisher = {{ACM}},
  year      = {2001},
  url       = {http://dl.acm.org/citation.cfm?id=383962},
  isbn      = {1-58113-383-9},
  timestamp = {Wed, 23 May 2012 17:48:28 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/podc/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2001,
  editor    = {Afonso Ferreira and
               Horst Reichel},
  title     = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
               Science, Dresden, Germany, February 15-17, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2010},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44693-1},
  doi       = {10.1007/3-540-44693-1},
  isbn      = {3-540-41695-1},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2001,
  editor    = {Frank K. H. A. Dehne and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Roberto Tamassia},
  title     = {Algorithms and Data Structures, 7th International Workshop, {WADS}
               2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2125},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44634-6},
  doi       = {10.1007/3-540-44634-6},
  isbn      = {3-540-42423-7},
  timestamp = {Mon, 05 Jun 2017 12:38:39 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2000,
  editor    = {Raffaele Giancarlo and
               David Sankoff},
  title     = {Combinatorial Pattern Matching, 11th Annual Symposium, {CPM} 2000,
               Montreal, Canada, June 21-23, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1848},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-45123-4},
  doi       = {10.1007/3-540-45123-4},
  isbn      = {3-540-67633-3},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2000,
  editor    = {Ugo Montanari and
               Jos{\'{e}} D. P. Rolim and
               Emo Welzl},
  title     = {Automata, Languages and Programming, 27th International Colloquium,
               {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1853},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-45022-X},
  doi       = {10.1007/3-540-45022-X},
  isbn      = {3-540-67715-1},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/99,
  editor    = {Jir{\'{\i}} Wiedermann and
               Peter van Emde Boas and
               Mogens Nielsen},
  title     = {Automata, Languages and Programming, 26th International Colloquium,
               ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1644},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-48523-6},
  doi       = {10.1007/3-540-48523-6},
  isbn      = {3-540-66224-3},
  timestamp = {Wed, 14 Nov 2018 11:00:14 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/1999,
  editor    = {Robert Endre Tarjan and
               Tandy J. Warnow},
  title     = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500},
  isbn      = {0-89871-434-6},
  timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1999,
  editor    = {Christoph Meinel and
               Sophie Tison},
  title     = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
               Science, Trier, Germany, March 4-6, 1999, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1563},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-49116-3},
  doi       = {10.1007/3-540-49116-3},
  timestamp = {Thu, 15 Jun 2017 21:34:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cats/1998,
  editor    = {Xuemin Lin},
  title     = {Proceedings of Computing: The Fourth Australasian Theory Symposium
               (CATS'98), Perth, WA, Australia, February 2-3, 1998},
  series    = {Australian Computer Science Communications},
  volume    = {20},
  number    = {3},
  publisher = {Springer-Verlag Singapore Pte. Ltd.},
  year      = {1998},
  timestamp = {Tue, 03 Mar 2009 12:54:23 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/cats/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/1998,
  title     = {Proceedings of the 10th Canadian Conference on Computational Geometry,
               McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
               August 10-12, 1998},
  year      = {1998},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/1998,
  editor    = {Kim Guldstrand Larsen and
               Sven Skyum and
               Glynn Winskel},
  title     = {Automata, Languages and Programming, 25th International Colloquium,
               ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1443},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/BFb0055035},
  doi       = {10.1007/BFb0055035},
  isbn      = {3-540-64781-3},
  timestamp = {Tue, 23 May 2017 11:53:58 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1998,
  editor    = {Michel Morvan and
               Christoph Meinel and
               Daniel Krob},
  title     = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
               Science, Paris, France, February 25-27, 1998, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1373},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/BFb0028542},
  doi       = {10.1007/BFb0028542},
  isbn      = {3-540-64230-7},
  timestamp = {Tue, 23 May 2017 11:53:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/1997,
  editor    = {Tao Jiang and
               D. T. Lee},
  title     = {Computing and Combinatorics, Third Annual International Conference,
               {COCOON} '97, Shanghai, China, August 20-22, 1997, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1276},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/BFb0045065},
  doi       = {10.1007/BFb0045065},
  isbn      = {3-540-63357-X},
  timestamp = {Mon, 22 May 2017 17:11:19 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/1997},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sirocco/1997,
  editor    = {Danny Krizanc and
               Peter Widmayer},
  title     = {SIROCCO'97, 4th International Colloquium on Structural Information
               {\&} Communication Complexity, Monte Verita, Ascona, Switzerland,
               July 24-26, 1997},
  publisher = {Carleton Scientific},
  year      = {1997},
  timestamp = {Fri, 30 Jan 2004 14:02:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sirocco/1997},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tapsoft/1997,
  editor    = {Michel Bidoit and
               Max Dauchet},
  title     = {TAPSOFT'97: Theory and Practice of Software Development, 7th International
               Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1214},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/BFb0030581},
  doi       = {10.1007/BFb0030581},
  isbn      = {3-540-62781-2},
  timestamp = {Mon, 22 May 2017 17:11:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tapsoft/1997},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/1996,
  editor    = {Daniel S. Hirschberg and
               Eugene W. Myers},
  title     = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna
               Beach, California, USA, June 10-12, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1075},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61258-0},
  doi       = {10.1007/3-540-61258-0},
  isbn      = {3-540-61258-0},
  timestamp = {Mon, 22 May 2017 16:14:05 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/1996},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/1996,
  editor    = {Josep D{\'{\i}}az and
               Maria J. Serna},
  title     = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
               Spain, September 25-27, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1136},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61680-2},
  doi       = {10.1007/3-540-61680-2},
  isbn      = {3-540-61680-2},
  timestamp = {Thu, 15 Jun 2017 21:39:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/1996},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/1996,
  editor    = {Tetsuo Asano and
               Yoshihide Igarashi and
               Hiroshi Nagamochi and
               Satoru Miyano and
               Subhash Suri},
  title     = {Algorithms and Computation, 7th International Symposium, {ISAAC} '96,
               Osaka, Japan, December 16-18, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1178},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/BFb0009475},
  doi       = {10.1007/BFb0009475},
  isbn      = {3-540-62048-6},
  timestamp = {Mon, 22 May 2017 16:14:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/1996},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/1996,
  editor    = {Wojciech Penczek and
               Andrzej Szalas},
  title     = {Mathematical Foundations of Computer Science 1996, 21st International
               Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1113},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61550-4},
  doi       = {10.1007/3-540-61550-4},
  isbn      = {3-540-61550-4},
  timestamp = {Mon, 22 May 2017 16:14:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/1996},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/1995,
  editor    = {Ding{-}Zhu Du and
               Ming Li},
  title     = {Computing and Combinatorics, First Annual International Conference,
               {COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {959},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/BFb0030813},
  doi       = {10.1007/BFb0030813},
  isbn      = {3-540-60216-X},
  timestamp = {Sat, 20 May 2017 15:32:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/1995},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/1995,
  editor    = {Paul G. Spirakis},
  title     = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
               September 25-27, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {979},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-60313-1},
  doi       = {10.1007/3-540-60313-1},
  isbn      = {3-540-60313-1},
  timestamp = {Sat, 20 May 2017 15:32:49 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/1995},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1995,
  editor    = {P. S. Thiagarajan},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1026},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-60692-0},
  doi       = {10.1007/3-540-60692-0},
  isbn      = {3-540-60692-0},
  timestamp = {Mon, 22 May 2017 16:14:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/1995},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1995,
  editor    = {Selim G. Akl and
               Frank K. H. A. Dehne and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Nicola Santoro},
  title     = {Algorithms and Data Structures, 4th International Workshop, {WADS}
               '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {955},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-60220-8},
  doi       = {10.1007/3-540-60220-8},
  isbn      = {3-540-60220-8},
  timestamp = {Mon, 05 Jun 2017 12:38:39 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/1995},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/1994,
  editor    = {Ding{-}Zhu Du and
               Xiang{-}Sun Zhang},
  title     = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
               Beijing, P. R. China, August 25-27, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {834},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58325-4},
  doi       = {10.1007/3-540-58325-4},
  isbn      = {3-540-58325-4},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/1994},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/1994,
  editor    = {Igor Pr{\'{\i}}vara and
               Branislav Rovan and
               Peter Ruzicka},
  title     = {Mathematical Foundations of Computer Science 1994, 19th International
               Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {841},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58338-6},
  doi       = {10.1007/3-540-58338-6},
  isbn      = {3-540-58338-6},
  timestamp = {Wed, 14 Nov 2018 10:59:26 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/1994},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1994,
  editor    = {Patrice Enjalbert and
               Ernst W. Mayr and
               Klaus W. Wagner},
  title     = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
               Science, Caen, France, February 24-26, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {775},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-57785-8},
  doi       = {10.1007/3-540-57785-8},
  isbn      = {3-540-57785-8},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1994},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1994,
  editor    = {Erik Meineche Schmidt and
               Sven Skyum},
  title     = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
               Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {824},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58218-5},
  doi       = {10.1007/3-540-58218-5},
  isbn      = {3-540-58218-5},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/1994},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/1993,
  title     = {Proceedings of the 5th Canadian Conference on Computational Geometry,
               Waterloo, Ontario, Canada, August 1993},
  publisher = {University of Waterloo},
  year      = {1993},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/1993},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/1993,
  editor    = {Chee Yap},
  title     = {Proceedings of the Ninth Annual Symposium on Computational GeometrySan
               Diego, CA, USA, May 19-21, 1993},
  publisher = {{ACM}},
  year      = {1993},
  url       = {https://doi.org/10.1145/160985},
  doi       = {10.1145/160985},
  isbn      = {0-89791-582-8},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/1993},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ipps/1993,
  title     = {The Seventh International Parallel Processing Symposium, Proceedings,
               Newport Beach, California, USA, April 13-16, 1993},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=454},
  isbn      = {0-8186-3442-1},
  timestamp = {Fri, 01 Aug 2014 14:26:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ipps/1993},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/1993,
  editor    = {Kam{-}Wing Ng and
               Prabhakar Raghavan and
               N. V. Balasubramanian and
               Francis Y. L. Chin},
  title     = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
               Hong Kong, December 15-17, 1993, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {762},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-57568-5},
  doi       = {10.1007/3-540-57568-5},
  isbn      = {3-540-57568-5},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/1993},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1993,
  editor    = {Patrice Enjalbert and
               Alain Finkel and
               Klaus W. Wagner},
  title     = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
               Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {665},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-56503-5},
  doi       = {10.1007/3-540-56503-5},
  isbn      = {3-540-56503-5},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1993},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/1992,
  editor    = {David Avis},
  title     = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
               Berlin, Germany, June 10-12, 1992},
  publisher = {{ACM}},
  year      = {1992},
  url       = {https://doi.org/10.1145/142675},
  doi       = {10.1145/142675},
  isbn      = {0-89791-517-8},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/1992},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1992,
  editor    = {R. K. Shyamasundar},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               12th Conference, New Delhi, India, December 18-20, 1992, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {652},
  publisher = {Springer},
  year      = {1992},
  url       = {https://doi.org/10.1007/3-540-56287-7},
  doi       = {10.1007/3-540-56287-7},
  isbn      = {3-540-56287-7},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/1992},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/1992,
  editor    = {Toshihide Ibaraki and
               Yasuyoshi Inagaki and
               Kazuo Iwama and
               Takao Nishizeki and
               Masafumi Yamashita},
  title     = {Algorithms and Computation, Third International Symposium, {ISAAC}
               '92, Nagoya, Japan, December 16-18, 1992, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {650},
  publisher = {Springer},
  year      = {1992},
  url       = {https://doi.org/10.1007/3-540-56279-6},
  doi       = {10.1007/3-540-56279-6},
  isbn      = {3-540-56279-6},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/1992},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/1992,
  editor    = {Imre Simon},
  title     = {{LATIN} '92, 1st Latin American Symposium on Theoretical Informatics,
               S{\~{a}}o Paulo, Brazil, April 6-10, 1992, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {583},
  publisher = {Springer},
  year      = {1992},
  url       = {https://doi.org/10.1007/BFb0023811},
  doi       = {10.1007/BFb0023811},
  isbn      = {3-540-55284-7},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/1992},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icci/1991,
  editor    = {Frank K. H. A. Dehne and
               Frantisek Fiala and
               Waldemar W. Koczkodaj},
  title     = {Advances in Computing and Information - ICCI'91, International Conference
               on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {497},
  publisher = {Springer},
  year      = {1991},
  url       = {https://doi.org/10.1007/3-540-54029-6},
  doi       = {10.1007/3-540-54029-6},
  isbn      = {3-540-54029-6},
  timestamp = {Sun, 04 Jun 2017 10:10:23 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icci/1991},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icpp/1991-3,
  title     = {Proceedings of the International Conference on Parallel Processing,
               {ICPP} '91, Austin, Texas, USA, August 1991. Volume {III:} Algorithms
               and Applications},
  publisher = {{CRC} Press},
  year      = {1991},
  timestamp = {Mon, 28 Jul 2014 17:06:01 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icpp/1991-3},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isa/1991,
  editor    = {Wen{-}Lian Hsu and
               Richard C. T. Lee},
  title     = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei,
               Republic of China, December 16-18, 1991, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {557},
  publisher = {Springer},
  year      = {1991},
  url       = {https://doi.org/10.1007/3-540-54945-5},
  doi       = {10.1007/3-540-54945-5},
  isbn      = {3-540-54945-5},
  timestamp = {Sat, 20 May 2017 15:32:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isa/1991},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1991,
  editor    = {Frank K. H. A. Dehne and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Nicola Santoro},
  title     = {Algorithms and Data Structures, 2nd Workshop {WADS} '91, Ottawa, Canada,
               August 14-16, 1991, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {519},
  publisher = {Springer},
  year      = {1991},
  url       = {https://doi.org/10.1007/BFb0028243},
  doi       = {10.1007/BFb0028243},
  isbn      = {3-540-54343-0},
  timestamp = {Sat, 20 May 2017 15:32:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/1991},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1990,
  editor    = {Kesav V. Nori and
               C. E. Veni Madhavan},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {472},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/3-540-53487-3},
  doi       = {10.1007/3-540-53487-3},
  isbn      = {3-540-53487-3},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/1990},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sigal/1990,
  editor    = {Tetsuo Asano and
               Toshihide Ibaraki and
               Hiroshi Imai and
               Takao Nishizeki},
  title     = {Algorithms, International Symposium {SIGAL} '90, Tokyo, Japan, August
               16-18, 1990, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {450},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/3-540-52921-7},
  doi       = {10.1007/3-540-52921-7},
  isbn      = {3-540-52921-7},
  timestamp = {Fri, 19 May 2017 13:10:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sigal/1990},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1990,
  editor    = {John R. Gilbert and
               Rolf G. Karlsson},
  title     = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
               Norway, July 11-14, 1990, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {447},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/3-540-52846-6},
  doi       = {10.1007/3-540-52846-6},
  isbn      = {3-540-52846-6},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/1990},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/oa/1989,
  editor    = {Hristo Djidjev},
  title     = {Optimal Algorithms, International Symposium, Varna, Bulgaria, May
               29 - June 2, 1989, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {401},
  publisher = {Springer},
  year      = {1989},
  url       = {https://doi.org/10.1007/3-540-51859-2},
  doi       = {10.1007/3-540-51859-2},
  isbn      = {3-540-51859-2},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/oa/1989},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1989,
  editor    = {Burkhard Monien and
               Robert Cori},
  title     = {{STACS} 89, 6th Annual Symposium on Theoretical Aspects of Computer
               Science, Paderborn, FRG, February 16-18, 1989, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {349},
  publisher = {Springer},
  year      = {1989},
  url       = {https://doi.org/10.1007/BFb0028968},
  doi       = {10.1007/BFb0028968},
  isbn      = {3-540-50840-6},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1989},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/1988,
  editor    = {Timo Lepist{\"{o}} and
               Arto Salomaa},
  title     = {Automata, Languages and Programming, 15th International Colloquium,
               ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {317},
  publisher = {Springer},
  year      = {1988},
  url       = {https://doi.org/10.1007/3-540-19488-6},
  doi       = {10.1007/3-540-19488-6},
  isbn      = {3-540-19488-6},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/1988},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1988,
  editor    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
               Sweden, July 5-8, 1988, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {318},
  publisher = {Springer},
  year      = {1988},
  url       = {https://doi.org/10.1007/3-540-19487-8},
  doi       = {10.1007/3-540-19487-8},
  isbn      = {3-540-19487-8},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/1988},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/1988,
  editor    = {Jan van Leeuwen},
  title     = {Graph-Theoretic Concepts in Computer Science, 14th International Workshop,
               {WG} '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {344},
  publisher = {Springer},
  year      = {1989},
  url       = {https://doi.org/10.1007/3-540-50728-0},
  doi       = {10.1007/3-540-50728-0},
  isbn      = {3-540-50728-0},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/1988},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1987,
  editor    = {Kesav V. Nori},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               Seventh Conference, Pune, India, December 17-19, 1987, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {287},
  publisher = {Springer},
  year      = {1987},
  url       = {https://doi.org/10.1007/3-540-18625-5},
  doi       = {10.1007/3-540-18625-5},
  isbn      = {3-540-18625-5},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/1987},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/1987,
  editor    = {Thomas Ottmann},
  title     = {Automata, Languages and Programming, 14th International Colloquium,
               ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {267},
  publisher = {Springer},
  year      = {1987},
  url       = {https://doi.org/10.1007/3-540-18088-5},
  doi       = {10.1007/3-540-18088-5},
  isbn      = {3-540-18088-5},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/1987},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/1986,
  editor    = {Alok Aggarwal},
  title     = {Proceedings of the Second Annual {ACM} {SIGACT/SIGGRAPH} Symposium
               on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986},
  publisher = {{ACM}},
  year      = {1986},
  url       = {https://doi.org/10.1145/10515},
  doi       = {10.1145/10515},
  isbn      = {0-89791-194-6},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/1986},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1986,
  editor    = {Burkhard Monien and
               Guy Vidal{-}Naquet},
  title     = {{STACS} 86, 3rd Annual Symposium on Theoretical Aspects of Computer
               Science, Orsay, France, January 16-18, 1986, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {210},
  publisher = {Springer},
  year      = {1986},
  url       = {https://doi.org/10.1007/3-540-16078-7},
  doi       = {10.1007/3-540-16078-7},
  isbn      = {3-540-16078-7},
  timestamp = {Fri, 19 May 2017 12:26:19 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1986},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/1985,
  editor    = {Joseph O'Rourke},
  title     = {Proceedings of the First Annual Symposium on Computational Geometry,
               Baltimore, Maryland, USA, June 5-7, 1985},
  publisher = {{ACM}},
  year      = {1985},
  url       = {https://doi.org/10.1145/323233},
  doi       = {10.1145/323233},
  isbn      = {0-89791-163-6},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/1985},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1984,
  editor    = {Mathai Joseph and
               R. K. Shyamasundar},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {181},
  publisher = {Springer},
  year      = {1984},
  url       = {https://doi.org/10.1007/3-540-13883-8},
  doi       = {10.1007/3-540-13883-8},
  isbn      = {3-540-13883-8},
  timestamp = {Fri, 19 May 2017 12:26:23 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/1984},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1984,
  editor    = {Max Fontet and
               Kurt Mehlhorn},
  title     = {{STACS} 84, Symposium of Theoretical Aspects of Computer Science,
               Paris, France, 11-13 April, 1984, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {166},
  publisher = {Springer},
  year      = {1984},
  url       = {https://doi.org/10.1007/3-540-12920-0},
  doi       = {10.1007/3-540-12920-0},
  isbn      = {3-540-12920-0},
  timestamp = {Fri, 19 May 2017 12:26:19 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1984},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/caap/1983,
  editor    = {Giorgio Ausiello and
               Marco Protasi},
  title     = {CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila,
               Italy, March 9-11, 1983, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {159},
  publisher = {Springer},
  year      = {1983},
  url       = {https://doi.org/10.1007/3-540-12727-5},
  doi       = {10.1007/3-540-12727-5},
  isbn      = {3-540-12727-5},
  timestamp = {Fri, 19 May 2017 12:26:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/caap/1983},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fct/1983,
  editor    = {Marek Karpinski},
  title     = {Fundamentals of Computation Theory, Proceedings of the 1983 International
               FCT-Conference, Borgholm, Sweden, August 21-27, 1983},
  series    = {Lecture Notes in Computer Science},
  volume    = {158},
  publisher = {Springer},
  year      = {1983},
  url       = {https://doi.org/10.1007/3-540-12689-9},
  doi       = {10.1007/3-540-12689-9},
  isbn      = {3-540-12689-9},
  timestamp = {Fri, 19 May 2017 12:26:22 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fct/1983},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tcs/1983,
  editor    = {Armin B. Cremers and
               Hans{-}Peter Kriegel},
  title     = {Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany,
               January 5-7, 1983, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {145},
  publisher = {Springer},
  year      = {1982},
  url       = {https://doi.org/10.1007/BFb0036464},
  doi       = {10.1007/BFb0036464},
  isbn      = {3-540-11973-6},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tcs/1983},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/1982,
  editor    = {Mogens Nielsen and
               Erik Meineche Schmidt},
  title     = {Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark,
               July 12-16, 1982, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {140},
  publisher = {Springer},
  year      = {1982},
  url       = {https://doi.org/10.1007/BFb0012751},
  doi       = {10.1007/BFb0012751},
  isbn      = {3-540-11576-5},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/1982},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/caap/1981,
  editor    = {Egidio Astesiano and
               Corrado B{\"{o}}hm},
  title     = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa,
               Italy, March 5-7, 1981, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {112},
  publisher = {Springer},
  year      = {1981},
  url       = {https://doi.org/10.1007/3-540-10828-9},
  doi       = {10.1007/3-540-10828-9},
  isbn      = {3-540-10828-9},
  timestamp = {Fri, 19 May 2017 12:26:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/caap/1981},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/1978,
  editor    = {Giorgio Ausiello and
               Corrado B{\"{o}}hm},
  title     = {Automata, Languages and Programming, Fifth Colloquium, Udine, Italy,
               July 17-21, 1978, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {62},
  publisher = {Springer},
  year      = {1978},
  url       = {https://doi.org/10.1007/3-540-08860-1},
  doi       = {10.1007/3-540-08860-1},
  isbn      = {3-540-08860-1},
  timestamp = {Fri, 19 May 2017 12:26:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/1978},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier