Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Martin Tancer
@article{DBLP:journals/dcg/PatakT24,
author = {Pavel Pat{\'{a}}k and
Martin Tancer},
title = {Embeddings of k-Complexes into 2k-Manifolds},
journal = {Discret. Comput. Geom.},
volume = {71},
number = {3},
pages = {960--991},
year = {2024},
url = {https://doi.org/10.1007/s00454-023-00595-w},
doi = {10.1007/S00454-023-00595-W},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/PatakT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BulavkaTT23,
author = {Denys Bulavka and
Martin Tancer and
Mykhaylo Tyomkyn},
title = {Weak Saturation of Multipartite Hypergraphs},
journal = {Comb.},
volume = {43},
number = {6},
pages = {1081--1102},
year = {2023},
url = {https://doi.org/10.1007/s00493-023-00049-0},
doi = {10.1007/S00493-023-00049-0},
timestamp = {Wed, 06 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/BulavkaTT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SkotnicaT23,
author = {Michael Skotnica and
Martin Tancer},
title = {NP-Hardness of Computing {PL} Geometric Category in Dimension 2},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {3},
pages = {2016--2029},
year = {2023},
url = {https://doi.org/10.1137/22m1523960},
doi = {10.1137/22M1523960},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SkotnicaT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatakT23,
author = {Pavel Pat{\'{a}}k and
Martin Tancer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Shellability Is Hard Even for Balls},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1271--1284},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585152},
doi = {10.1145/3564246.3585152},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PatakT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-07421,
author = {Martin Tancer},
title = {Simpler algorithmically unrecognizable 4-manifolds},
journal = {CoRR},
volume = {abs/2310.07421},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.07421},
doi = {10.48550/ARXIV.2310.07421},
eprinttype = {arXiv},
eprint = {2310.07421},
timestamp = {Thu, 26 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-07421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KaluzaT22,
author = {Vojtech Kaluza and
Martin Tancer},
title = {Even Maps, the Colin de Verdi{\`{e}}re Number and Representations
of Graphs},
journal = {Comb.},
volume = {42},
number = {Supplement 2},
pages = {1317--1345},
year = {2022},
url = {https://doi.org/10.1007/s00493-021-4443-7},
doi = {10.1007/S00493-021-4443-7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/KaluzaT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/PatakovaTW22,
author = {Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
title = {Barycentric Cuts Through a Convex Body},
journal = {Discret. Comput. Geom.},
volume = {68},
number = {4},
pages = {1133--1154},
year = {2022},
url = {https://doi.org/10.1007/s00454-021-00364-7},
doi = {10.1007/S00454-021-00364-7},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/PatakovaTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Legrand-Duchesne22,
author = {Cl{\'{e}}ment Legrand{-}Duchesne and
Ashutosh Rai and
Martin Tancer},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Parameterized Complexity of Untangling Knots},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {88:1--88:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.88},
doi = {10.4230/LIPICS.ICALP.2022.88},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Legrand-Duchesne22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-13981,
author = {Michael Skotnica and
Martin Tancer},
title = {NP-hardness of computing {PL} geometric category in dimension 2},
journal = {CoRR},
volume = {abs/2204.13981},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.13981},
doi = {10.48550/ARXIV.2204.13981},
eprinttype = {arXiv},
eprint = {2204.13981},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-13981.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-07978,
author = {Pavel Pat{\'{a}}k and
Martin Tancer},
title = {Shellability is hard even for balls},
journal = {CoRR},
volume = {abs/2211.07978},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.07978},
doi = {10.48550/ARXIV.2211.07978},
eprinttype = {arXiv},
eprint = {2211.07978},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-07978.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MagnardST21,
author = {Thomas Magnard and
Michael Skotnica and
Martin Tancer},
title = {Shellings and Sheddings Induced by Collapses},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {3},
pages = {1978--2002},
year = {2021},
url = {https://doi.org/10.1137/19M1290826},
doi = {10.1137/19M1290826},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/MagnardST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BulavkaGT21,
author = {Denys Bulavka and
Afshin Goodarzi and
Martin Tancer},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Optimal Bounds for the Colorful Fractional Helly Theorem},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.19},
doi = {10.4230/LIPICS.SOCG.2021.19},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/BulavkaGT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-05001,
author = {Cl{\'{e}}ment Legrand{-}Duchesne and
Ashutosh Rai and
Martin Tancer},
title = {Parameterized complexity of untangling knots},
journal = {CoRR},
volume = {abs/2111.05001},
year = {2021},
url = {https://arxiv.org/abs/2111.05001},
eprinttype = {arXiv},
eprint = {2111.05001},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-05001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MesmayRST20,
author = {Arnaud de Mesmay and
Yo'av Rieck and
Eric Sedgwick and
Martin Tancer},
title = {Embeddability in R\({}^{\mbox{3}}\) is NP-hard},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {20:1--20:29},
year = {2020},
url = {https://doi.org/10.1145/3396593},
doi = {10.1145/3396593},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MesmayRST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JelinekKKT20,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Ida Kantor and
Jan Kyncl and
Martin Tancer},
title = {On the growth of the M{\"{o}}bius function of permutations},
journal = {J. Comb. Theory, Ser. {A}},
volume = {169},
year = {2020},
url = {https://doi.org/10.1016/j.jcta.2019.105121},
doi = {10.1016/J.JCTA.2019.105121},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/JelinekKKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/PatakovaT020,
author = {Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
editor = {Sergio Cabello and
Danny Z. Chen},
title = {Barycentric Cuts Through a Convex Body},
booktitle = {36th International Symposium on Computational Geometry, SoCG 2020,
June 23-26, 2020, Z{\"{u}}rich, Switzerland},
series = {LIPIcs},
volume = {164},
pages = {62:1--62:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2020.62},
doi = {10.4230/LIPICS.SOCG.2020.62},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/PatakovaT020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaluzaT20,
author = {Vojtech Kaluza and
Martin Tancer},
editor = {Shuchi Chawla},
title = {Even maps, the Colin de Verdi{\`{e}}re number and representations
of graphs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2642--2657},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.161},
doi = {10.1137/1.9781611975994.161},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/KaluzaT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-13536,
author = {Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
title = {Barycentric cuts through a convex body},
journal = {CoRR},
volume = {abs/2003.13536},
year = {2020},
url = {https://arxiv.org/abs/2003.13536},
eprinttype = {arXiv},
eprint = {2003.13536},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-13536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/SkopenkovT19,
author = {Arkadiy Skopenkov and
Martin Tancer},
title = {Hardness of almost embedding simplicial complexes in R\({}^{\mbox{d}}\)},
journal = {Discret. Comput. Geom.},
volume = {61},
number = {2},
pages = {452--463},
year = {2019},
url = {https://doi.org/10.1007/s00454-018-0013-1},
doi = {10.1007/S00454-018-0013-1},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/SkopenkovT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoaocPPTW19,
author = {Xavier Goaoc and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
title = {Shellability is NP-complete},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {21:1--21:18},
year = {2019},
url = {https://doi.org/10.1145/3314024},
doi = {10.1145/3314024},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GoaocPPTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MesmayRST19,
author = {Arnaud de Mesmay and
Yo'av Rieck and
Eric Sedgwick and
Martin Tancer},
editor = {Gill Barequet and
Yusu Wang},
title = {The Unbearable Hardness of Unknotting},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {49:1--49:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.49},
doi = {10.4230/LIPICS.SOCG.2019.49},
timestamp = {Mon, 02 Jan 2023 09:02:13 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/MesmayRST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-02404,
author = {Pavel Pat{\'{a}}k and
Martin Tancer},
title = {Embeddings of k-complexes into 2k-manifolds},
journal = {CoRR},
volume = {abs/1904.02404},
year = {2019},
url = {http://arxiv.org/abs/1904.02404},
eprinttype = {arXiv},
eprint = {1904.02404},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-02404.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-05055,
author = {Vojtech Kaluza and
Martin Tancer},
title = {Even maps, the Colin de{\textasciitilde}Verdi{\`{e}}re number and
representations of graphs},
journal = {CoRR},
volume = {abs/1907.05055},
year = {2019},
url = {https://arxiv.org/abs/1907.05055},
eprinttype = {arXiv},
eprint = {1907.05055},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-05055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BaranyMNT18,
author = {Imre B{\'{a}}r{\'{a}}ny and
Roy Meshulam and
Eran Nevo and
Martin Tancer},
title = {Pach's Selection Theorem Does Not Admit a Topological Extension},
journal = {Discret. Comput. Geom.},
volume = {60},
number = {2},
pages = {420--429},
year = {2018},
url = {https://doi.org/10.1007/s00454-018-9998-8},
doi = {10.1007/S00454-018-9998-8},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BaranyMNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MatousekSTW18,
author = {Jir{\'{\i}} Matousek and
Eric Sedgwick and
Martin Tancer and
Uli Wagner},
title = {Embeddability in the 3-Sphere Is Decidable},
journal = {J. {ACM}},
volume = {65},
number = {1},
pages = {5:1--5:49},
year = {2018},
url = {https://doi.org/10.1145/3078632},
doi = {10.1145/3078632},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MatousekSTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GoaocPPT018,
author = {Xavier Goaoc and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Shellability is NP-Complete},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {41:1--41:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.41},
doi = {10.4230/LIPICS.SOCG.2018.41},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GoaocPPT018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MesmayRST18,
author = {Arnaud de Mesmay and
Yo'av Rieck and
Eric Sedgwick and
Martin Tancer},
editor = {Artur Czumaj},
title = {Embeddability in {\(\mathbb{R}\)}\({}^{\mbox{3}}\) is NP-hard},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1316--1329},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.86},
doi = {10.1137/1.9781611975031.86},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MesmayRST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/HubardKMT17,
author = {Alfredo Hubard and
Vojtech Kaluza and
Arnaud de Mesmay and
Martin Tancer},
title = {Shortest Path Embeddings of Graphs on Surfaces},
journal = {Discret. Comput. Geom.},
volume = {58},
number = {4},
pages = {921--945},
year = {2017},
url = {https://doi.org/10.1007/s00454-017-9898-3},
doi = {10.1007/S00454-017-9898-3},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/HubardKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/VerdiereKPPT17,
author = {{\'{E}}ric Colin de Verdi{\`{e}}re and
Vojtech Kaluza and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer},
title = {A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective
Plane},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {939--981},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00445},
doi = {10.7155/JGAA.00445},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/VerdiereKPPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SkopenkovT17,
author = {Arkadiy Skopenkov and
Martin Tancer},
title = {Hardness of almost embedding simplicial complexes in R\({}^{\mbox{d}}\)},
journal = {CoRR},
volume = {abs/1703.06305},
year = {2017},
url = {http://arxiv.org/abs/1703.06305},
eprinttype = {arXiv},
eprint = {1703.06305},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SkopenkovT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-07734,
author = {Arnaud de Mesmay and
Yo'av Rieck and
Eric Sedgwick and
Martin Tancer},
title = {Embeddability in R\({}^{\mbox{3}}\) is NP-hard},
journal = {CoRR},
volume = {abs/1708.07734},
year = {2017},
url = {http://arxiv.org/abs/1708.07734},
eprinttype = {arXiv},
eprint = {1708.07734},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-07734.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-08436,
author = {Xavier Goaoc and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
title = {Shellability is NP-complete},
journal = {CoRR},
volume = {abs/1711.08436},
year = {2017},
url = {http://arxiv.org/abs/1711.08436},
eprinttype = {arXiv},
eprint = {1711.08436},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-08436.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Tancer16,
author = {Martin Tancer},
title = {Recognition of Collapsible Complexes is NP-Complete},
journal = {Discret. Comput. Geom.},
volume = {55},
number = {1},
pages = {21--38},
year = {2016},
url = {https://doi.org/10.1007/s00454-015-9747-1},
doi = {10.1007/S00454-015-9747-1},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Tancer16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/HubardKMT16,
author = {Alfredo Hubard and
Vojtech Kaluza and
Arnaud de Mesmay and
Martin Tancer},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {Shortest Path Embeddings of Graphs on Surfaces},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {43:1--43:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.43},
doi = {10.4230/LIPICS.SOCG.2016.43},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/HubardKMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/VerdiereKPPT16,
author = {{\'{E}}ric Colin de Verdi{\`{e}}re and
Vojtech Kaluza and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective
Plane},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {454--467},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_35},
doi = {10.1007/978-3-319-50106-2\_35},
timestamp = {Sat, 17 Dec 2022 21:30:20 +0100},
biburl = {https://dblp.org/rec/conf/gd/VerdiereKPPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HubardKMT16,
author = {Alfredo Hubard and
Vojtech Kaluza and
Arnaud de Mesmay and
Martin Tancer},
title = {Shortest path embeddings of graphs on surfaces},
journal = {CoRR},
volume = {abs/1602.06778},
year = {2016},
url = {http://arxiv.org/abs/1602.06778},
eprinttype = {arXiv},
eprint = {1602.06778},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/HubardKMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VerdiereKPPT16,
author = {{\'{E}}ric Colin de Verdi{\`{e}}re and
Vojtech Kaluza and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer},
title = {A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective
Plane},
journal = {CoRR},
volume = {abs/1608.07855},
year = {2016},
url = {http://arxiv.org/abs/1608.07855},
eprinttype = {arXiv},
eprint = {1608.07855},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/VerdiereKPPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GoaocMPST15,
author = {Xavier Goaoc and
Jir{\'{\i}} Matousek and
Pavel Pat{\'{a}}k and
Zuzana Safernov{\'{a}} and
Martin Tancer},
title = {Simplifying Inclusion-Exclusion Formulas},
journal = {Comb. Probab. Comput.},
volume = {24},
number = {2},
pages = {438--456},
year = {2015},
url = {https://doi.org/10.1017/S096354831400042X},
doi = {10.1017/S096354831400042X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GoaocMPST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KarasevKPPT15,
author = {Roman N. Karasev and
Jan Kyncl and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer},
title = {Bounds for Pach's Selection Theorem and for the Minimum Solid Angle
in a Simplex},
journal = {Discret. Comput. Geom.},
volume = {54},
number = {3},
pages = {610--636},
year = {2015},
url = {https://doi.org/10.1007/s00454-015-9720-z},
doi = {10.1007/S00454-015-9720-Z},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/KarasevKPPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GoaocMPPTW15,
author = {Xavier Goaoc and
Isaac Mabillard and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {On Generalized Heawood Inequalities for Manifolds: {A} Van Kampen-Flores-type
Nonembeddability Result},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {476--490},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.476},
doi = {10.4230/LIPICS.SOCG.2015.476},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GoaocMPPTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GoaocPPTW15,
author = {Xavier Goaoc and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {Bounding Helly Numbers via Betti Numbers},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {507--521},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.507},
doi = {10.4230/LIPICS.SOCG.2015.507},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GoaocPPTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/TancerV14,
author = {Martin Tancer and
Kathrin Vorwerk},
title = {Non-Embeddability of Geometric Lattices and Buildings},
journal = {Discret. Comput. Geom.},
volume = {51},
number = {4},
pages = {779--801},
year = {2014},
url = {https://doi.org/10.1007/s00454-014-9591-8},
doi = {10.1007/S00454-014-9591-8},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/TancerV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MatousekSTW14,
author = {Jir{\'{\i}} Matousek and
Eric Sedgwick and
Martin Tancer and
Uli Wagner},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {Embeddability in the 3-sphere is decidable},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {78},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582137},
doi = {10.1145/2582112.2582137},
timestamp = {Mon, 14 Jun 2021 16:39:30 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MatousekSTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MatousekSTW14,
author = {Jir{\'{\i}} Matousek and
Eric Sedgwick and
Martin Tancer and
Uli Wagner},
title = {Embeddability in the 3-sphere is decidable},
journal = {CoRR},
volume = {abs/1402.0815},
year = {2014},
url = {http://arxiv.org/abs/1402.0815},
eprinttype = {arXiv},
eprint = {1402.0815},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/MatousekSTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TancerT13,
author = {Martin Tancer and
Dmitry Tonkonog},
title = {Nerves of Good Covers Are Algorithmically Unrecognizable},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1697--1719},
year = {2013},
url = {https://doi.org/10.1137/120891204},
doi = {10.1137/120891204},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TancerT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/MatousekSTW13,
author = {Jir{\'{\i}} Matousek and
Eric Sedgwick and
Martin Tancer and
Uli Wagner},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {Untangling Two Systems of Noncrossing Curves},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {472--483},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_41},
doi = {10.1007/978-3-319-03841-4\_41},
timestamp = {Sun, 13 Nov 2022 09:57:27 +0100},
biburl = {https://dblp.org/rec/conf/gd/MatousekSTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoaocPSTW13,
author = {Xavier Goaoc and
Pavel Pat{\'{a}}k and
Zuzana Safernov{\'{a}} and
Martin Tancer and
Uli Wagner},
title = {Bounding Helly numbers via Betti numbers},
journal = {CoRR},
volume = {abs/1310.4613},
year = {2013},
url = {http://arxiv.org/abs/1310.4613},
eprinttype = {arXiv},
eprint = {1310.4613},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoaocPSTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/MatousekTW12,
author = {Jir{\'{\i}} Matousek and
Martin Tancer and
Uli Wagner},
title = {A Geometric Proof of the Colored Tverberg Theorem},
journal = {Discret. Comput. Geom.},
volume = {47},
number = {2},
pages = {245--265},
year = {2012},
url = {https://doi.org/10.1007/s00454-011-9368-2},
doi = {10.1007/S00454-011-9368-2},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/MatousekTW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Tancer12,
author = {Martin Tancer},
title = {A Counterexample to Wegner's Conjecture on Good Covers},
journal = {Discret. Comput. Geom.},
volume = {47},
number = {2},
pages = {266--274},
year = {2012},
url = {https://doi.org/10.1007/s00454-011-9356-6},
doi = {10.1007/S00454-011-9356-6},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Tancer12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-6082,
author = {Martin Tancer and
Dmitry Tonkonog},
title = {Good covers are algorithmically unrecognizable},
journal = {CoRR},
volume = {abs/1205.6082},
year = {2012},
url = {http://arxiv.org/abs/1205.6082},
eprinttype = {arXiv},
eprint = {1205.6082},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-6082.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-6254,
author = {Martin Tancer},
title = {Recognition of collapsible complexes is NP-complete},
journal = {CoRR},
volume = {abs/1211.6254},
year = {2012},
url = {http://arxiv.org/abs/1211.6254},
eprinttype = {arXiv},
eprint = {1211.6254},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-6254.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/Tancer11,
author = {Martin Tancer},
title = {Strong d-collapsibility},
journal = {Contributions Discret. Math.},
volume = {6},
number = {2},
year = {2011},
url = {http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/226},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cdm/Tancer11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Tancer11,
author = {Martin Tancer},
title = {d-representability of simplicial complexes of fixed dimension},
journal = {J. Comput. Geom.},
volume = {2},
number = {1},
pages = {183--188},
year = {2011},
url = {https://doi.org/10.20382/jocg.v2i1a9},
doi = {10.20382/JOCG.V2I1A9},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Tancer11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BilkaJKTV11,
author = {Ondrej B{\'{\i}}lka and
Jozef Jir{\'{a}}sek and
Pavel Klav{\'{\i}}k and
Martin Tancer and
Jan Volec},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {On the Complexity of Planar Covering of Small Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {83--94},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_9},
doi = {10.1007/978-3-642-25870-1\_9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BilkaJKTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-0064,
author = {Ondrej B{\'{\i}}lka and
Jozef Jir{\'{a}}sek and
Pavel Klav{\'{\i}}k and
Martin Tancer and
Jan Volec},
title = {On the Complexity of Planar Covering of Small Graphs},
journal = {CoRR},
volume = {abs/1108.0064},
year = {2011},
url = {http://arxiv.org/abs/1108.0064},
eprinttype = {arXiv},
eprint = {1108.0064},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-0064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/Tancer10,
author = {Martin Tancer},
title = {d-collapsibility is NP-complete for d greater or equal to 4},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2010},
year = {2010},
url = {http://cjtcs.cs.uchicago.edu/articles/2010/3/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/Tancer10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MiskufST10,
author = {Jozef Miskuf and
Riste Skrekovski and
Martin Tancer},
title = {Backbone colorings of graphs with bounded degree},
journal = {Discret. Appl. Math.},
volume = {158},
number = {5},
pages = {534--542},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.11.015},
doi = {10.1016/J.DAM.2009.11.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MiskufST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BjornerT09,
author = {Anders Bj{\"{o}}rner and
Martin Tancer},
title = {Note: Combinatorial Alexander Duality - {A} Short and Elementary Proof},
journal = {Discret. Comput. Geom.},
volume = {42},
number = {4},
pages = {586--593},
year = {2009},
url = {https://doi.org/10.1007/s00454-008-9102-x},
doi = {10.1007/S00454-008-9102-X},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BjornerT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/MatousekT09,
author = {Jir{\'{\i}} Matousek and
Martin Tancer},
title = {Dimension Gaps between Representability and Collapsibility},
journal = {Discret. Comput. Geom.},
volume = {42},
number = {4},
pages = {631--639},
year = {2009},
url = {https://doi.org/10.1007/s00454-008-9091-9},
doi = {10.1007/S00454-008-9091-9},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/MatousekT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LuzarST09,
author = {Borut Luzar and
Riste Skrekovski and
Martin Tancer},
title = {Injective colorings of planar graphs with few colors},
journal = {Discret. Math.},
volume = {309},
number = {18},
pages = {5636--5649},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.005},
doi = {10.1016/J.DISC.2008.04.005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/LuzarST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Tancer09,
author = {Martin Tancer},
title = {d-collapsibility is NP-complete for d{\textgreater}=4},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {53--57},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.009},
doi = {10.1016/J.ENDM.2009.07.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Tancer09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MiskufST09,
author = {Jozef Miskuf and
Riste Skrekovski and
Martin Tancer},
title = {Backbone Colorings and Generalized Mycielski Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {2},
pages = {1063--1070},
year = {2009},
url = {https://doi.org/10.1137/080717596},
doi = {10.1137/080717596},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MiskufST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MatousekTW09,
author = {Jir{\'{\i}} Matousek and
Martin Tancer and
Uli Wagner},
editor = {Claire Mathieu},
title = {Hardness of embedding simplicial complexes in \emph{R}\({}^{\mbox{d}}\)},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {855--864},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.93},
doi = {10.1137/1.9781611973068.93},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MatousekTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KynclT08,
author = {Jan Kyncl and
Martin Tancer},
title = {The Maximum Piercing Number for some Classes of Convex Sets with the
(4, 3)-property},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r27.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KynclT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DvorakST08,
author = {Zdenek Dvor{\'{a}}k and
Riste Skrekovski and
Martin Tancer},
title = {List-Coloring Squares of Sparse Subcubic Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {1},
pages = {139--159},
year = {2008},
url = {https://doi.org/10.1137/050634049},
doi = {10.1137/050634049},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DvorakST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0807-0336,
author = {Jir{\'{\i}} Matousek and
Martin Tancer and
Uli Wagner},
title = {Hardness of embedding simplicial complexes in R\({}^{\mbox{d}}\)},
journal = {CoRR},
volume = {abs/0807.0336},
year = {2008},
url = {http://arxiv.org/abs/0807.0336},
eprinttype = {arXiv},
eprint = {0807.0336},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0807-0336.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KralST06,
author = {Daniel Kr{\'{a}}l and
Riste Skrekovski and
Martin Tancer},
title = {Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {2},
pages = {536--543},
year = {2006},
url = {https://doi.org/10.1137/050623061},
doi = {10.1137/050623061},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KralST06.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.
last updated on 2024-04-02 22:43 CEST 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:
