Search dblp for Publications

export results for "toc:db/journals/mst/mst62.bht:"

 download as .bib file

@article{DBLP:journals/mst/0001DK18,
  author       = {Shantanu Das and
                  Dariusz Dereniowski and
                  Christina Karousatou},
  title        = {Collaborative Exploration of Trees by Energy-Constrained Mobile Robots},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1223--1240},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9816-3},
  doi          = {10.1007/S00224-017-9816-3},
  timestamp    = {Sat, 05 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/0001DK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/0001DKRR18,
  author       = {Spyros Angelopoulos and
                  Christoph D{\"{u}}rr and
                  Shahin Kamali and
                  Marc P. Renault and
                  Adi Ros{\'{e}}n},
  title        = {Online Bin Packing with Advice of Small Size},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {2006--2034},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9862-5},
  doi          = {10.1007/S00224-018-9862-5},
  timestamp    = {Tue, 11 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/0001DKRR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/0001M018,
  author       = {R. Krithika and
                  Diptapriyo Majumdar and
                  Venkatesh Raman},
  title        = {Revisiting Connected Vertex Cover: {FPT} Algorithms and Lossy Kernels},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1690--1714},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9837-y},
  doi          = {10.1007/S00224-017-9837-Y},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/0001M018.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Abu-KhzamMHS18,
  author       = {Faisal N. Abu{-}Khzam and
                  Christine Markarian and
                  Friedhelm Meyer auf der Heide and
                  Michael Schubert},
  title        = {Approximation and Heuristic Algorithms for Computing Backbones in
                  Asymmetric Ad-hoc Networks},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1673--1689},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9836-z},
  doi          = {10.1007/S00224-017-9836-Z},
  timestamp    = {Thu, 13 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Abu-KhzamMHS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AgarwalCCRS18,
  author       = {Archita Agarwal and
                  Venkatesan T. Chakaravarthy and
                  Anamitra R. Choudhury and
                  Sambudha Roy and
                  Yogish Sabharwal},
  title        = {Set Cover Problems with Small Neighborhood Covers},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1763--1797},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9842-1},
  doi          = {10.1007/S00224-017-9842-1},
  timestamp    = {Tue, 11 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/AgarwalCCRS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Agrawal0SZ18,
  author       = {Akanksha Agrawal and
                  Saket Saurabh and
                  Roohani Sharma and
                  Meirav Zehavi},
  title        = {Parameterised Algorithms for Deletion to Classes of DAGs},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1880--1909},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9852-7},
  doi          = {10.1007/S00224-018-9852-7},
  timestamp    = {Tue, 02 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/Agrawal0SZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BanerjeeC0S18,
  author       = {Niranka Banerjee and
                  Sankardeep Chakraborty and
                  Venkatesh Raman and
                  Srinivasa Rao Satti},
  title        = {Space Efficient Linear Time Algorithms for BFS, {DFS} and Applications},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1736--1762},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9841-2},
  doi          = {10.1007/S00224-017-9841-2},
  timestamp    = {Thu, 13 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BanerjeeC0S18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BansalEJKP18,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Lukasz Jez and
                  Grigorios Koumoutsos and
                  Kirk Pruhs},
  title        = {Tight Bounds for Double Coverage Against Weak Adversaries},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {349--365},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9703-3},
  doi          = {10.1007/S00224-016-9703-3},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BansalEJKP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BecherCH18,
  author       = {Ver{\'{o}}nica Becher and
                  Olivier Carton and
                  Pablo Ariel Heiber},
  title        = {Finite-State Independence},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {7},
  pages        = {1555--1572},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9821-6},
  doi          = {10.1007/S00224-017-9821-6},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BecherCH18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BevernFK18,
  author       = {Ren{\'{e}} van Bevern and
                  Vincent Froese and
                  Christian Komusiewicz},
  title        = {Parameterizing Edge Modification Problems Above Lower Bounds},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {739--770},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9746-5},
  doi          = {10.1007/S00224-016-9746-5},
  timestamp    = {Sat, 17 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/BevernFK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BhattacharyaJK18,
  author       = {Anup Bhattacharya and
                  Ragesh Jaiswal and
                  Amit Kumar},
  title        = {Faster Algorithms for the Constrained k-means Problem},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {93--115},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9820-7},
  doi          = {10.1007/S00224-017-9820-7},
  timestamp    = {Fri, 12 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/BhattacharyaJK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BilleCCG18,
  author       = {Philip Bille and
                  Anders Roy Christiansen and
                  Patrick Hagge Cording and
                  Inge Li G{\o}rtz},
  title        = {Finger Search in Grammar-Compressed Strings},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1715--1735},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9839-9},
  doi          = {10.1007/S00224-017-9839-9},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BilleCCG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bilo18,
  author       = {Vittorio Bil{\`{o}}},
  title        = {A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions
                  in Weighted Congestion Games},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1288--1317},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9826-1},
  doi          = {10.1007/S00224-017-9826-1},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Bilo18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodirskyM18,
  author       = {Manuel Bodirsky and
                  Marcello Mamino},
  title        = {Tropically Convex Constraint Satisfaction},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {481--509},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9762-0},
  doi          = {10.1007/S00224-017-9762-0},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BodirskyM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BohmV18,
  author       = {Martin B{\"{o}}hm and
                  Pavel Vesel{\'{y}}},
  title        = {Online Chromatic Number is PSPACE-Complete},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1366--1391},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9797-2},
  doi          = {10.1007/S00224-017-9797-2},
  timestamp    = {Tue, 29 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/BohmV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BohmovaHMPSS18,
  author       = {Katerina B{\"{o}}hmov{\'{a}} and
                  Luca H{\"{a}}fliger and
                  Mat{\'{u}}s Mihal{\'{a}}k and
                  Tobias Pr{\"{o}}ger and
                  Gustavo Sacomoto and
                  Marie{-}France Sagot},
  title        = {Computing and Listing st-Paths in Public Transportation Networks},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {600--621},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9747-4},
  doi          = {10.1007/S00224-016-9747-4},
  timestamp    = {Thu, 15 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/BohmovaHMPSS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BosekLSZ18,
  author       = {Bartlomiej Bosek and
                  Dariusz Leniowski and
                  Piotr Sankowski and
                  Anna Zych{-}Pawlewicz},
  title        = {Shortest Augmenting Paths for Online Matchings on Trees},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {337--348},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9838-x},
  doi          = {10.1007/S00224-017-9838-X},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/BosekLSZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BournezCR18,
  author       = {Olivier Bournez and
                  Johanne Cohen and
                  Mika{\"{e}}l Rabie},
  title        = {Homonym Population Protocols},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1318--1346},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9833-2},
  doi          = {10.1007/S00224-017-9833-2},
  timestamp    = {Sat, 05 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BournezCR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BoyarFKM18,
  author       = {Joan Boyar and
                  Lene M. Favrholdt and
                  Christian Kudahl and
                  Jesper W. Mikkelsen},
  title        = {Weighted Online Problems with Advice},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1443--1469},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9806-5},
  doi          = {10.1007/S00224-017-9806-5},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/BoyarFKM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrzozowskiSY18,
  author       = {Janusz A. Brzozowski and
                  Marek Szykula and
                  Yuli Ye},
  title        = {Syntactic Complexity of Regular Ideals},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1175--1202},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9803-8},
  doi          = {10.1007/S00224-017-9803-8},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BrzozowskiSY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanKLS18,
  author       = {Harry Buhrman and
                  Michal Kouck{\'{y}} and
                  Bruno Loff and
                  Florian Speelman},
  title        = {Catalytic Space: Non-determinism and Hierarchy},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {116--135},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9784-7},
  doi          = {10.1007/S00224-017-9784-7},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BuhrmanKLS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CadilhacKM18,
  author       = {Micha{\"{e}}l Cadilhac and
                  Andreas Krebs and
                  Pierre McKenzie},
  title        = {The Algebraic Theory of Parikh Automata},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1241--1268},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9817-2},
  doi          = {10.1007/S00224-017-9817-2},
  timestamp    = {Sat, 05 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CadilhacKM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaludeS18,
  author       = {Cristian S. Calude and
                  Ludwig Staiger},
  title        = {Liouville, Computable, Borel Normal and Martin-L{\"{o}}f Random
                  Numbers},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {7},
  pages        = {1573--1585},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9767-8},
  doi          = {10.1007/S00224-017-9767-8},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CaludeS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CanonneDGR18,
  author       = {Cl{\'{e}}ment L. Canonne and
                  Ilias Diakonikolas and
                  Themis Gouleakis and
                  Ronitt Rubinfeld},
  title        = {Testing Shape Restrictions of Discrete Distributions},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {4--62},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9785-6},
  doi          = {10.1007/S00224-017-9785-6},
  timestamp    = {Thu, 25 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/CanonneDGR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Case18,
  author       = {Adam Case},
  title        = {Bounded Turing Reductions and Data Processing Inequalities for Sequences},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {7},
  pages        = {1586--1598},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9804-7},
  doi          = {10.1007/S00224-017-9804-7},
  timestamp    = {Sat, 11 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Case18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CenzerP18,
  author       = {Douglas Cenzer and
                  Christopher P. Porter},
  title        = {The Random Members of a {\(\Pi\)}\({}_{\mbox{1}}\)\({}^{\mbox{0}}\)
                  Class},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {7},
  pages        = {1637--1671},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9824-3},
  doi          = {10.1007/S00224-017-9824-3},
  timestamp    = {Wed, 25 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CenzerP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChenDHT18,
  author       = {Xujin Chen and
                  Zhuo Diao and
                  Xiaodong Hu and
                  Zhongzheng Tang},
  title        = {Covering Triangles in Edge-Weighted Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1525--1552},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9860-7},
  doi          = {10.1007/S00224-018-9860-7},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/ChenDHT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CornelissenHMNR18,
  author       = {Kamiel Cornelissen and
                  Ruben Hoeksma and
                  Bodo Manthey and
                  N. S. Narayanaswamy and
                  C. S. Rahul and
                  Marten Waanders},
  title        = {Approximation Algorithms for Connected Graph Factors of Minimum Weight},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {441--464},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9723-z},
  doi          = {10.1007/S00224-016-9723-Z},
  timestamp    = {Thu, 28 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CornelissenHMNR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CzerwinskiDMP18,
  author       = {Wojciech Czerwinski and
                  Claire David and
                  Filip Murlak and
                  Pawel Parys},
  title        = {Reasoning about integrity constraints for tree-structured data},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {4},
  pages        = {941--976},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9771-z},
  doi          = {10.1007/S00224-017-9771-Z},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CzerwinskiDMP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Damaschke18,
  author       = {Peter Damaschke},
  title        = {The Solution Space of Sorting with Recurring Comparison Faults},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1427--1442},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9807-4},
  doi          = {10.1007/S00224-017-9807-4},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Damaschke18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DattaL18,
  author       = {Ajoy K. Datta and
                  Lawrence L. Larmore},
  title        = {Self-Stabilizing Leader Election in Dynamic Networks},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {977--1047},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9758-9},
  doi          = {10.1007/S00224-017-9758-9},
  timestamp    = {Thu, 03 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DattaL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Davies18,
  author       = {Sylvie Davies},
  title        = {Primitivity, Uniform Minimality, and State Complexity of Boolean Operations},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1952--2005},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9859-0},
  doi          = {10.1007/S00224-018-9859-0},
  timestamp    = {Tue, 11 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Davies18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DowneyHK18,
  author       = {Rod Downey and
                  Denis R. Hirschfeldt and
                  Bj{\o}rn Kjos{-}Hanssen},
  title        = {Preface},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {7},
  pages        = {1553--1554},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9853-6},
  doi          = {10.1007/S00224-018-9853-6},
  timestamp    = {Wed, 03 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DowneyHK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DumitrescuMT18,
  author       = {Adrian Dumitrescu and
                  Ritankar Mandal and
                  Csaba D. T{\'{o}}th},
  title        = {Monotone Paths in Geometric Triangulations},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1490--1524},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9855-4},
  doi          = {10.1007/S00224-018-9855-4},
  timestamp    = {Tue, 05 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DumitrescuMT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DurrV18,
  author       = {Christoph D{\"{u}}rr and
                  Heribert Vollmer},
  title        = {Preface of {STACS} 2016 Special Issue},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {1--3},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9830-5},
  doi          = {10.1007/S00224-017-9830-5},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DurrV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EbrahimiMM18,
  author       = {Roozbeh Ebrahimi and
                  Samuel McCauley and
                  Benjamin Moseley},
  title        = {Scheduling Parallel Jobs Online with Convex and Concave Parallelizability},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {304--318},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9722-0},
  doi          = {10.1007/S00224-016-9722-0},
  timestamp    = {Fri, 02 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/EbrahimiMM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FeketeHMPP18,
  author       = {S{\'{a}}ndor P. Fekete and
                  Kan Huang and
                  Joseph S. B. Mitchell and
                  Ojas Parekh and
                  Cynthia A. Phillips},
  title        = {Geometric Hitting Set for Segments of Few Orientations},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {268--303},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9744-7},
  doi          = {10.1007/S00224-016-9744-7},
  timestamp    = {Tue, 06 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/FeketeHMPP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FreydenbergerH18,
  author       = {Dominik D. Freydenberger and
                  Mario Holldack},
  title        = {Document Spanners: From Expressive Power to Decision Problems},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {4},
  pages        = {854--898},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9770-0},
  doi          = {10.1007/S00224-017-9770-0},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/FreydenbergerH18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FujitoS18,
  author       = {Toshihiro Fujito and
                  Tomoaki Shimoda},
  title        = {On Approximating (Connected) 2-Edge Dominating Set by a Tree},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {533--556},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9764-y},
  doi          = {10.1007/S00224-017-9764-Y},
  timestamp    = {Sat, 17 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/FujitoS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GawrychowskiIIK18,
  author       = {Pawel Gawrychowski and
                  Tomohiro I and
                  Shunsuke Inenaga and
                  Dominik K{\"{o}}ppl and
                  Florin Manea},
  title        = {Tighter Bounds and Optimal Algorithms for All Maximal {\(\alpha\)}-gapped
                  Repeats and Palindromes - Finding All Maximal {\(\alpha\)}-gapped
                  Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {162--191},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9794-5},
  doi          = {10.1007/S00224-017-9794-5},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/GawrychowskiIIK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GawrychowskiZ18,
  author       = {Pawel Gawrychowski and
                  Lukasz Zatorski},
  title        = {Speeding up dynamic programming in the line-constrained k-median},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1351--1365},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9780-y},
  doi          = {10.1007/S00224-017-9780-Y},
  timestamp    = {Tue, 10 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/GawrychowskiZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GolovachKPS18,
  author       = {Petr A. Golovach and
                  Dieter Kratsch and
                  Dani{\"{e}}l Paulusma and
                  Anthony Stewart},
  title        = {Finding Cactus Roots in Polynomial Time},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1409--1426},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9825-2},
  doi          = {10.1007/S00224-017-9825-2},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/GolovachKPS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GuelloumaCZW18,
  author       = {Younes Guellouma and
                  Hadda Cherroun and
                  Djelloul Ziadi and
                  Bruce W. Watson},
  title        = {From Tree Automata to String Automata Minimization},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1203--1222},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9815-4},
  doi          = {10.1007/S00224-017-9815-4},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/GuelloumaCZW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hecht18,
  author       = {Michael Hecht},
  title        = {Exact Localisations of Feedback Sets},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1048--1084},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9777-6},
  doi          = {10.1007/S00224-017-9777-6},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Hecht18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HigashikawaCKKS18,
  author       = {Yuya Higashikawa and
                  Siu{-}Wing Cheng and
                  Tsunehiko Kameda and
                  Naoki Katoh and
                  Shun Saburi},
  title        = {Minimax Regret 1-Median Problem in Dynamic Path Networks},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1392--1408},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9783-8},
  doi          = {10.1007/S00224-017-9783-8},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/HigashikawaCKKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HolsK18,
  author       = {Eva{-}Maria C. Hols and
                  Stefan Kratsch},
  title        = {A Randomized Polynomial Kernel for Subset Feedback Vertex Set},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {63--92},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9805-6},
  doi          = {10.1007/S00224-017-9805-6},
  timestamp    = {Fri, 12 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/HolsK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/IlcinkasW18,
  author       = {David Ilcinkas and
                  Ahmed Mouhamadou Wade},
  title        = {Exploration of the T-Interval-Connected Dynamic Graphs: the Case of
                  the Ring},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1144--1160},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9796-3},
  doi          = {10.1007/S00224-017-9796-3},
  timestamp    = {Sat, 05 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/IlcinkasW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/IljazovicP18,
  author       = {Zvonko Iljazovic and
                  Bojan Pazek},
  title        = {Co-c.e. Sets with Disconnected Complements},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1109--1124},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9781-x},
  doi          = {10.1007/S00224-017-9781-X},
  timestamp    = {Sat, 05 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/IljazovicP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JoglekarR18,
  author       = {Manas Joglekar and
                  Christopher R{\'{e}}},
  title        = {It's All a Matter of Degree - Using Degree Information to Optimize
                  Multiway Joins},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {4},
  pages        = {810--853},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9811-8},
  doi          = {10.1007/S00224-017-9811-8},
  timestamp    = {Fri, 13 Apr 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/JoglekarR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KaminskiK18,
  author       = {Mark Kaminski and
                  Egor V. Kostylev},
  title        = {Complexity and Expressive Power of Weakly Well-Designed {SPARQL}},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {4},
  pages        = {772--809},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9802-9},
  doi          = {10.1007/S00224-017-9802-9},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/KaminskiK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KolaitisPSS18,
  author       = {Phokion G. Kolaitis and
                  Reinhard Pichler and
                  Emanuel Sallinger and
                  Vadim Savenkov},
  title        = {Limits of Schema Mappings},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {4},
  pages        = {899--940},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9812-7},
  doi          = {10.1007/S00224-017-9812-7},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/KolaitisPSS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Kozachinskiy18,
  author       = {Alexander Kozachinskiy},
  title        = {On Slepian-Wolf Theorem with Interaction},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {583--599},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9741-x},
  doi          = {10.1007/S00224-016-9741-X},
  timestamp    = {Sat, 17 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/Kozachinskiy18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KufleitnerW18,
  author       = {Manfred Kufleitner and
                  Tobias Walter},
  title        = {Level Two of the Quantifier Alternation Hierarchy Over Infinite Words},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {467--480},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9801-x},
  doi          = {10.1007/S00224-017-9801-X},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/KufleitnerW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KufleitnerW18a,
  author       = {Manfred Kufleitner and
                  Jan Philipp W{\"{a}}chter},
  title        = {The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {682--738},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9763-z},
  doi          = {10.1007/S00224-017-9763-Z},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/KufleitnerW18a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KulikovW18,
  author       = {Alexander S. Kulikov and
                  Gerhard J. Woeginger},
  title        = {Preface to the Special Issue on Computer Science in Russia 2016},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {465--466},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9854-5},
  doi          = {10.1007/S00224-018-9854-5},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/KulikovW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LohreyZ18,
  author       = {Markus Lohrey and
                  Georg Zetzsche},
  title        = {Knapsack in Graph Groups},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {192--246},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9808-3},
  doi          = {10.1007/S00224-017-9808-3},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/LohreyZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MahajanS18,
  author       = {Meena Mahajan and
                  Nitin Saurabh},
  title        = {Some Complete and Intermediate Polynomials in Algebraic Complexity
                  Theory},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {622--652},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9740-y},
  doi          = {10.1007/S00224-016-9740-Y},
  timestamp    = {Thu, 23 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/MahajanS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Majumdar0018,
  author       = {Diptapriyo Majumdar and
                  Venkatesh Raman and
                  Saket Saurabh},
  title        = {Polynomial Kernels for Vertex Cover Parameterized by Small Degree
                  Modulators},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1910--1951},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9858-1},
  doi          = {10.1007/S00224-018-9858-1},
  timestamp    = {Thu, 13 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Majumdar0018.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MakinenP18,
  author       = {Veli M{\"{a}}kinen and
                  Simon J. Puglisi},
  title        = {Editorial: Special Issue on "Combinatorial Algorithms" {(IWOCA} 2016)},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1349--1350},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9861-6},
  doi          = {10.1007/S00224-018-9861-6},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/MakinenP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MansourPV18,
  author       = {Yishay Mansour and
                  Boaz Patt{-}Shamir and
                  Shai Vardi},
  title        = {Constant-Time Local Computation Algorithms},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {249--267},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9788-3},
  doi          = {10.1007/S00224-017-9788-3},
  timestamp    = {Fri, 02 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/MansourPV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Martens18,
  author       = {Wim Martens},
  title        = {Foreword: Special Issue on Database Theory},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {4},
  pages        = {771},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9835-0},
  doi          = {10.1007/S00224-017-9835-0},
  timestamp    = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Martens18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mayordomo18,
  author       = {Elvira Mayordomo},
  title        = {Effective Hausdorff Dimension in General Metric Spaces},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {7},
  pages        = {1620--1636},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9848-3},
  doi          = {10.1007/S00224-018-9848-3},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Mayordomo18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Miyabe18,
  author       = {Kenshi Miyabe},
  title        = {Coherence of Reducibilities with Randomness Notions},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {7},
  pages        = {1599--1619},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9752-2},
  doi          = {10.1007/S00224-017-9752-2},
  timestamp    = {Sat, 11 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Miyabe18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Moriakov18,
  author       = {Nikita Moriakov},
  title        = {On Effective Birkhoff's Ergodic Theorem for Computable Actions of
                  Amenable Groups},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1269--1287},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9822-5},
  doi          = {10.1007/S00224-017-9822-5},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Moriakov18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MozesS18,
  author       = {Shay Mozes and
                  Eyal E. Skop},
  title        = {Efficient Vertex-Label Distance Oracles for Planar Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {419--440},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9827-0},
  doi          = {10.1007/S00224-017-9827-0},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/MozesS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/NiewerthS18,
  author       = {Matthias Niewerth and
                  Thomas Schwentick},
  title        = {Reasoning About {XML} Constraints Based on XML-to-Relational Mappings},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1826--1879},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9846-5},
  doi          = {10.1007/S00224-018-9846-5},
  timestamp    = {Tue, 11 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/NiewerthS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Nutov18,
  author       = {Zeev Nutov},
  title        = {Improved Approximation Algorithms for Minimum Cost Node-Connectivity
                  Augmentation Problems},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {510--532},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9786-5},
  doi          = {10.1007/S00224-017-9786-5},
  timestamp    = {Sat, 17 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/Nutov18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Oliveira18,
  author       = {Mateus de Oliveira Oliveira},
  title        = {Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness
                  Function},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {1},
  pages        = {136--161},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9814-5},
  doi          = {10.1007/S00224-017-9814-5},
  timestamp    = {Thu, 25 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/Oliveira18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Paluch18,
  author       = {Katarzyna E. Paluch},
  title        = {Maximum {ATSP} with Weights Zero and One via Half-Edges},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {319--336},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9818-1},
  doi          = {10.1007/S00224-017-9818-1},
  timestamp    = {Thu, 20 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Paluch18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PaulyS18,
  author       = {Arno Pauly and
                  Florian Steinberg},
  title        = {Comparing Representations for Function Spaces in Computable Analysis},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {557--582},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9745-6},
  doi          = {10.1007/S00224-016-9745-6},
  timestamp    = {Mon, 02 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/PaulyS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ReinekeS18,
  author       = {Jan Reineke and
                  Alejandro Salinger},
  title        = {On the Smoothness of Paging Algorithms},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {366--418},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9813-6},
  doi          = {10.1007/S00224-017-9813-6},
  timestamp    = {Wed, 04 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/ReinekeS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SanitaS18,
  author       = {Laura Sanit{\`{a}} and
                  Martin Skutella},
  title        = {{WAOA} 2015 Special Issue on {TOCS}},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {2},
  pages        = {247--248},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9850-9},
  doi          = {10.1007/S00224-018-9850-9},
  timestamp    = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/SanitaS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SarkarCBV18,
  author       = {Kaushik Sarkar and
                  Charles J. Colbourn and
                  Annalisa De Bonis and
                  Ugo Vaccaro},
  title        = {Partial Covering Arrays: Algorithms and Asymptotics},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {6},
  pages        = {1470--1489},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9782-9},
  doi          = {10.1007/S00224-017-9782-9},
  timestamp    = {Tue, 05 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/SarkarCBV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SchaeferS18,
  author       = {Marcus Schaefer and
                  Daniel Stefankovic},
  title        = {The Complexity of Tensor Rank},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1161--1174},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9800-y},
  doi          = {10.1007/S00224-017-9800-Y},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/SchaeferS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Scharpfenecker18,
  author       = {Patrick Scharpfenecker},
  title        = {Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1125--1143},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9787-4},
  doi          = {10.1007/S00224-017-9787-4},
  timestamp    = {Sat, 05 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Scharpfenecker18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Smith18,
  author       = {Tim Smith},
  title        = {Prediction of Infinite Words with Automata},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {3},
  pages        = {653--681},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-016-9739-4},
  doi          = {10.1007/S00224-016-9739-4},
  timestamp    = {Sat, 17 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/Smith18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SoltaniRG18,
  author       = {Sanaz Soltani and
                  Mohammadreza Razzazi and
                  Hossein Ghasemalizadeh},
  title        = {The Most Points Connected-Covering Problem with Two Disks},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {2035--2047},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9870-5},
  doi          = {10.1007/S00224-018-9870-5},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/SoltaniRG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Taubenfeld18,
  author       = {Gadi Taubenfeld},
  title        = {A Closer Look at Fault Tolerance},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {5},
  pages        = {1085--1108},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-017-9779-4},
  doi          = {10.1007/S00224-017-9779-4},
  timestamp    = {Thu, 03 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Taubenfeld18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/YangG18,
  author       = {Yongjie Yang and
                  Jiong Guo},
  title        = {Parameterized Complexity of Voter Control in Multi-Peaked Elections},
  journal      = {Theory Comput. Syst.},
  volume       = {62},
  number       = {8},
  pages        = {1798--1825},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00224-018-9843-8},
  doi          = {10.1007/S00224-018-9843-8},
  timestamp    = {Mon, 23 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/YangG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics