Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/approx/approx2000.bht:"
download as .bib file
@inproceedings{DBLP:conf/approx/AgeevHS00,
author = {Alexander A. Ageev and
Refael Hassin and
Maxim Sviridenko},
editor = {Klaus Jansen and
Samir Khuller},
title = {An approximation algorithm for {MAX} {DICUT} with given sizes of parts},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {34--41},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_5},
doi = {10.1007/3-540-44436-X\_5},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AgeevHS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Arora00,
author = {Sanjeev Arora},
editor = {Klaus Jansen and
Samir Khuller},
title = {Approximation algorithms that take advice},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {1},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_1},
doi = {10.1007/3-540-44436-X\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Arora00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AulettaCKP00,
author = {Vincenzo Auletta and
Ioannis Caragiannis and
Christos Kaklamanis and
Pino Persiano},
editor = {Klaus Jansen and
Samir Khuller},
title = {Randomized path coloring on binary trees},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {60--71},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_8},
doi = {10.1007/3-540-44436-X\_8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AulettaCKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AwerbuchAR00,
author = {Baruch Awerbuch and
Yossi Azar and
Oded Regev},
editor = {Klaus Jansen and
Samir Khuller},
title = {Maximizing job benefits on-line},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {42--50},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_6},
doi = {10.1007/3-540-44436-X\_6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AwerbuchAR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanF00,
author = {Piotr Berman and
Junichiro Fukuyama},
editor = {Klaus Jansen and
Samir Khuller},
title = {Variable length sequencing with two lengths},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {51--59},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_7},
doi = {10.1007/3-540-44436-X\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CapraraIMPS00,
author = {Alberto Caprara and
Giuseppe F. Italiano and
Gurusamy Mohan and
Alessandro Panconesi and
Aravind Srinivasan},
editor = {Klaus Jansen and
Samir Khuller},
title = {Wavelength rerouting in optical networks, or the Venetian routing
problem},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {72--83},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_9},
doi = {10.1007/3-540-44436-X\_9},
timestamp = {Mon, 11 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/CapraraIMPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Charikar00,
author = {Moses Charikar},
editor = {Klaus Jansen and
Samir Khuller},
title = {Greedy approximation algorithms for finding dense components in a
graph},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {84--95},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_10},
doi = {10.1007/3-540-44436-X\_10},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Charikar00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DasGuptaP00,
author = {Bhaskar DasGupta and
Michael A. Palis},
editor = {Klaus Jansen and
Samir Khuller},
title = {Online real-time preemptive scheduling of jobs with deadlines},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {96--107},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_11},
doi = {10.1007/3-540-44436-X\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DasGuptaP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DyerGGJ00,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Mark Jerrum},
editor = {Klaus Jansen and
Samir Khuller},
title = {On the relative complexity of approximate counting problems},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {108--119},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_12},
doi = {10.1007/3-540-44436-X\_12},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/DyerGGJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeLN00,
author = {Uriel Feige and
Michael Langberg and
Kobbi Nissim},
editor = {Klaus Jansen and
Samir Khuller},
title = {On the hardness of approximating \emph{N P} witnesses},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {120--131},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_13},
doi = {10.1007/3-540-44436-X\_13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/FeigeLN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeketeM00,
author = {S{\'{a}}ndor P. Fekete and
Henk Meijer},
editor = {Klaus Jansen and
Samir Khuller},
title = {Maximum dispersion and geometric maximum weight cliques},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {132--143},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_14},
doi = {10.1007/3-540-44436-X\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/FeketeM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FleischerS00,
author = {Rudolf Fleischer and
Steven S. Seiden},
editor = {Klaus Jansen and
Samir Khuller},
title = {New results for online page replication},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {144--154},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_15},
doi = {10.1007/3-540-44436-X\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/FleischerS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Guruswami00,
author = {Venkatesan Guruswami},
editor = {Klaus Jansen and
Samir Khuller},
title = {Inapproximability results for set splitting and satisfiability problems
with no mixed clauses},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {155--166},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_16},
doi = {10.1007/3-540-44436-X\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Guruswami00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HassinRS00,
author = {Refael Hassin and
R. Ravi and
F. Sibel Salman},
editor = {Klaus Jansen and
Samir Khuller},
title = {Approximation algorithms for a capacitated network design problem},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {167--176},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_17},
doi = {10.1007/3-540-44436-X\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/HassinRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Hochbaum00,
author = {Dorit S. Hochbaum},
editor = {Klaus Jansen and
Samir Khuller},
title = {Instant recognition of polynominal time solvability, half integrality
and 2-approximations},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {2--14},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_2},
doi = {10.1007/3-540-44436-X\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Hochbaum00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JainV00,
author = {Kamal Jain and
Vijay V. Vazirani},
editor = {Klaus Jansen and
Samir Khuller},
title = {An approximation algorithm for the fault tolerant metric facility
location problem},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {177--183},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_18},
doi = {10.1007/3-540-44436-X\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/JainV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KonemannKPS00,
author = {Jochen K{\"{o}}nemann and
Goran Konjevod and
Ojas Parekh and
Amitabh Sinha},
editor = {Klaus Jansen and
Samir Khuller},
title = {Improved approximations for tour and tree covers},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {184--193},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_19},
doi = {10.1007/3-540-44436-X\_19},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KonemannKPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KortsarzN00,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Klaus Jansen and
Samir Khuller},
title = {Approximating node connectivity problems via set covers},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {194--205},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_20},
doi = {10.1007/3-540-44436-X\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KortsarzN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LorysP00,
author = {Krzysztof Lorys and
Katarzyna E. Paluch},
editor = {Klaus Jansen and
Samir Khuller},
title = {Rectangle tiling},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {206--213},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_21},
doi = {10.1007/3-540-44436-X\_21},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LorysP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Mohring00,
author = {Rolf H. M{\"{o}}hring},
editor = {Klaus Jansen and
Samir Khuller},
title = {Scheduling under uncertainty: Optimizing against a randomizing adversary},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {15--26},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_3},
doi = {10.1007/3-540-44436-X\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Mohring00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/PolzinD00,
author = {Tobias Polzin and
Siavash {Vahdati Daneshmand}},
editor = {Klaus Jansen and
Samir Khuller},
title = {Primal-dual approaches to the Steiner problem},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {214--225},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_22},
doi = {10.1007/3-540-44436-X\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/PolzinD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Schindelhauer00,
author = {Christian Schindelhauer},
editor = {Klaus Jansen and
Samir Khuller},
title = {On the inapproximability of broadcasting time},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {226--237},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_23},
doi = {10.1007/3-540-44436-X\_23},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Schindelhauer00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ShachnaiT00,
author = {Hadas Shachnai and
Tami Tamir},
editor = {Klaus Jansen and
Samir Khuller},
title = {Polynominal time approximation schemes for class-constrained packing
problem},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {238--249},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_24},
doi = {10.1007/3-540-44436-X\_24},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ShachnaiT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Shmoys00,
author = {David B. Shmoys},
editor = {Klaus Jansen and
Samir Khuller},
title = {Approximation algorithms for facility location problems},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {27--33},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_4},
doi = {10.1007/3-540-44436-X\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Shmoys00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SteeP00,
author = {Rob van Stee and
Johannes A. La Poutr{\'{e}}},
editor = {Klaus Jansen and
Samir Khuller},
title = {Partial servicing of on-line jobs},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {250--261},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_25},
doi = {10.1007/3-540-44436-X\_25},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/SteeP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/VempalaV00,
author = {Santosh S. Vempala and
Adrian Vetta},
editor = {Klaus Jansen and
Samir Khuller},
title = {Factor 4/3 approximations for minimum 2-connected subgraphs},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {262--273},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_26},
doi = {10.1007/3-540-44436-X\_26},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/VempalaV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2000,
editor = {Klaus Jansen and
Samir Khuller},
title = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X},
doi = {10.1007/3-540-44436-X},
isbn = {3-540-67996-0},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2000.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-07-20 20:52 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:
