Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mst/mst49.bht:"
download as .bib file
@article{DBLP:journals/mst/AnshelevichC11,
author = {Elliot Anshelevich and
Bugra {\c{C}}askurlu},
title = {Price of Stability in Survivable Network Design},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {98--138},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9317-8},
doi = {10.1007/S00224-011-9317-8},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/AnshelevichC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ArenasBL11,
author = {Marcelo Arenas and
Pablo Barcel{\'{o}} and
Leonid Libkin},
title = {Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization},
journal = {Theory Comput. Syst.},
volume = {49},
number = {3},
pages = {639--670},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9292-5},
doi = {10.1007/S00224-010-9292-5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ArenasBL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ArenasBR11,
author = {Marcelo Arenas and
Pablo Barcel{\'{o}} and
Juan L. Reutter},
title = {Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {489--564},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9259-6},
doi = {10.1007/S00224-010-9259-6},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ArenasBR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AtseriasBCFGR11,
author = {Albert Atserias and
Mikolaj Bojanczyk and
Balder ten Cate and
Ronald Fagin and
Floris Geerts and
Kenneth A. Ross},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {365--366},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9329-4},
doi = {10.1007/S00224-011-9329-4},
timestamp = {Fri, 08 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AtseriasBCFGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AttiyaHM11,
author = {Hagit Attiya and
Eshcar Hillel and
Alessia Milani},
title = {Inherent Limitations on Disjoint-Access Parallel Implementations of
Transactional Memory},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {698--719},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9304-5},
doi = {10.1007/S00224-010-9304-5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AttiyaHM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AzarFGMR11,
author = {Yossi Azar and
Uriel Feige and
Iftah Gamzu and
Thomas Moscibroda and
Prasad Raghavendra},
title = {Buffer Management for Colored Packets with Deadlines},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {738--756},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9346-3},
doi = {10.1007/S00224-011-9346-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AzarFGMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BateniGHK11,
author = {MohammadHossein Bateni and
Lukasz Golab and
MohammadTaghi Hajiaghayi and
Howard J. Karloff},
title = {Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {757--780},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9347-2},
doi = {10.1007/S00224-011-9347-2},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BateniGHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BenderG11,
author = {Michael A. Bender and
Seth Gilbert},
title = {Guest Editorial: Parallelism in Algorithms and Architectures},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {671},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9363-2},
doi = {10.1007/S00224-011-9363-2},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BenderG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BiloFFM11,
author = {Vittorio Bil{\`{o}} and
Angelo Fanelli and
Michele Flammini and
Luca Moscardelli},
title = {Performance of One-Round Walks in Linear Congestion Games},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {24--45},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9309-0},
doi = {10.1007/S00224-010-9309-0},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BiloFFM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BiloFP11,
author = {Davide Bil{\`{o}} and
Luca Forlizzi and
Guido Proietti},
title = {Approximating the Metric {TSP} in Linear Time},
journal = {Theory Comput. Syst.},
volume = {49},
number = {3},
pages = {615--631},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9289-0},
doi = {10.1007/S00224-010-9289-0},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BiloFP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrandtBFH11,
author = {Felix Brandt and
Markus Brill and
Felix A. Fischer and
Jan Hoffmann},
title = {The Computational Complexity of Weak Saddles},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {139--161},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9298-z},
doi = {10.1007/S00224-010-9298-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BrandtBFH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrandtBFH11a,
author = {Felix Brandt and
Markus Brill and
Felix A. Fischer and
Paul Harrenstein},
title = {On the Complexity of Iterated Weak Dominance in Constant-Sum Games},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {162--181},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9282-7},
doi = {10.1007/S00224-010-9282-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BrandtBFH11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CautisDO11,
author = {Bogdan Cautis and
Alin Deutsch and
Nicola Onose},
title = {Querying Data Sources that Export Infinite Sets of Views},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {367--428},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9293-4},
doi = {10.1007/S00224-010-9293-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CautisDO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChanEP11,
author = {Ho{-}Leung Chan and
Jeff Edmonds and
Kirk Pruhs},
title = {Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {817--833},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9349-0},
doi = {10.1007/S00224-011-9349-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChanEP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChangLR11,
author = {Maw{-}Shang Chang and
Chuang{-}Chieh Lin and
Peter Rossmanith},
title = {A Property Tester for Tree-Likeness of Quartet Topologies},
journal = {Theory Comput. Syst.},
volume = {49},
number = {3},
pages = {576--587},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9276-5},
doi = {10.1007/S00224-010-9276-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChangLR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChoffrutK11,
author = {Christian Choffrut and
Juhani Karhum{\"{a}}ki},
title = {Unique Decipherability in the Monoid of Languages: An Application
of Rational Relations},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {355--364},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9324-9},
doi = {10.1007/S00224-011-9324-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChoffrutK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CohenDT11,
author = {Johanne Cohen and
Christoph D{\"{u}}rr and
Kim Thang Nguyen},
title = {Non-clairvoyant Scheduling Games},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {3--23},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9316-9},
doi = {10.1007/S00224-011-9316-9},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/CohenDT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FloreenHKKMS11,
author = {Patrik Flor{\'{e}}en and
Marja Hassinen and
Joel Kaasinen and
Petteri Kaski and
Topi Musto and
Jukka Suomela},
title = {Local Approximability of Max-Min and Min-Max Linear Programs},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {672--697},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9303-6},
doi = {10.1007/S00224-010-9303-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FloreenHKKMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GiacomoDLM11,
author = {Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Henk Meijer},
title = {Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph
Drawings},
journal = {Theory Comput. Syst.},
volume = {49},
number = {3},
pages = {565--575},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9275-6},
doi = {10.1007/S00224-010-9275-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GiacomoDLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Green11,
author = {Todd J. Green},
title = {Containment of Conjunctive Queries on Annotated Relations},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {429--459},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9327-6},
doi = {10.1007/S00224-011-9327-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Green11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GreenIT11,
author = {Todd J. Green and
Zachary G. Ives and
Val Tannen},
title = {Reconcilable Differences},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {460--488},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9323-x},
doi = {10.1007/S00224-011-9323-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GreenIT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HarkinsH11,
author = {Ryan C. Harkins and
John M. Hitchcock},
title = {Dimension, Halfspaces, and the Density of Hard Sets},
journal = {Theory Comput. Syst.},
volume = {49},
number = {3},
pages = {601--614},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9288-1},
doi = {10.1007/S00224-010-9288-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HarkinsH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HarksKM11,
author = {Tobias Harks and
Max Klimm and
Rolf H. M{\"{o}}hring},
title = {Characterizing the Existence of Potential Functions in Weighted Congestion
Games},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {46--70},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9315-x},
doi = {10.1007/S00224-011-9315-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HarksKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HauboldL11,
author = {Niko Haubold and
Markus Lohrey},
title = {Compressed Word Problems in HNN-extensions and Amalgamated Products},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {283--305},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9295-2},
doi = {10.1007/S00224-010-9295-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HauboldL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Jansen11,
author = {Maurice J. Jansen},
title = {Lower Bounds for the Determinantal Complexity of Explicit Low Degree
Polynomials},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {343--354},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9308-1},
doi = {10.1007/S00224-010-9308-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Jansen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JezO11a,
author = {Artur Jez and
Alexander Okhotin},
title = {One-Nonterminal Conjunctive Grammars over a Unary Alphabet},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {319--342},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9319-6},
doi = {10.1007/S00224-011-9319-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JezO11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Jiraskova11,
author = {Galina Jir{\'{a}}skov{\'{a}}},
title = {Concatenation of Regular Languages and Descriptional Complexity},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {306--318},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9318-7},
doi = {10.1007/S00224-011-9318-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Jiraskova11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JungC11,
author = {Hyunwoo Jung and
Kyung{-}Yong Chwa},
title = {The Balloon Popping Problem Revisited: Lower and Upper Bounds},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {182--195},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9314-y},
doi = {10.1007/S00224-011-9314-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JungC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Kawamura11,
author = {Akitoshi Kawamura},
title = {Generalized Semimagic Squares for Digital Halftoning},
journal = {Theory Comput. Syst.},
volume = {49},
number = {3},
pages = {632--638},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9290-7},
doi = {10.1007/S00224-010-9290-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Kawamura11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KochS11,
author = {Ronald Koch and
Martin Skutella},
title = {Nash Equilibria and the Price of Anarchy for Flows over Time},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {71--97},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9299-y},
doi = {10.1007/S00224-010-9299-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KochS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KuhnLO11,
author = {Fabian Kuhn and
Thomas Locher and
Rotem Oshman},
title = {Gradient Clock Synchronization in Dynamic Networks},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {781--816},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9348-1},
doi = {10.1007/S00224-011-9348-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KuhnLO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LinLWY11,
author = {Chien{-}Hung Lin and
Jia Jie Liu and
Yue{-}Li Wang and
William Chung{-}Kung Yen},
title = {The Hub Number of Sierpi{\'{n}}ski-Like Graphs},
journal = {Theory Comput. Syst.},
volume = {49},
number = {3},
pages = {588--600},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9286-3},
doi = {10.1007/S00224-010-9286-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LinLWY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mavronicolas11,
author = {Marios Mavronicolas},
title = {Preface: Algorithmic Game Theory},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {1--2},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9330-y},
doi = {10.1007/S00224-011-9330-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Mavronicolas11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MorozovW11,
author = {Andrei S. Morozov and
Klaus W. Wagner},
title = {Editorial},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {225--226},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9328-5},
doi = {10.1007/S00224-011-9328-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/MorozovW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MusatovRS11,
author = {Daniil Musatov and
Andrei E. Romashchenko and
Alexander Shen},
title = {Variations on Muchnik's Conditional Complexity Theorem},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {227--245},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9321-z},
doi = {10.1007/S00224-011-9321-Z},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MusatovRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/NisgavP11,
author = {Aviv Nisgav and
Boaz Patt{-}Shamir},
title = {Finding Similar Users in Social Networks},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {720--737},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9307-2},
doi = {10.1007/S00224-010-9307-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/NisgavP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RackeR11,
author = {Harald R{\"{a}}cke and
Adi Ros{\'{e}}n},
title = {Approximation Algorithms for Time-Constrained Scheduling on Line Networks},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {834--856},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9351-6},
doi = {10.1007/S00224-011-9351-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RackeR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RaoS11,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
title = {On the Complexity of Matroid Isomorphism Problem},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {246--272},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9260-0},
doi = {10.1007/S00224-010-9260-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RaoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ThielenK11,
author = {Clemens Thielen and
Sven Oliver Krumke},
title = {Truthful Mechanisms for Selfish Routing and Two-Parameter Agents},
journal = {Theory Comput. Syst.},
volume = {49},
number = {1},
pages = {196--223},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9281-8},
doi = {10.1007/S00224-010-9281-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ThielenK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Wahlstrom11,
author = {Magnus Wahlstr{\"{o}}m},
title = {New Plain-Exponential Time Classes for Graph Homomorphism},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {273--282},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9261-z},
doi = {10.1007/S00224-010-9261-Z},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Wahlstrom11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-30 04:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
