×

zbMATH — the first resource for mathematics

Found 590 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Fichte, Johannes K.; Hecher, Markus; Pfandler, Andreas
Lower bounds for QBFs of bounded treewidth. (English) Zbl 07299485
Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7104-9). 410-424 (2020).
MSC:  03B70
PDF BibTeX XML Cite
\textit{J. K. Fichte} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 410--424 (2020; Zbl 07299485)
Full Text: DOI
Ashok, Pradeesha; Bhargava, Rathin; Gupta, Naman; Khalid, Mohammad; Yadav, Dolly
Minimum conflict free colouring parameterized by treewidth. (English) Zbl 1453.68094
Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 439-450 (2020).
MSC:  68Q27 05C15 05C85 68Q17 68R10 68W25
PDF BibTeX XML Cite
\textit{P. Ashok} et al., Lect. Notes Comput. Sci. 12016, 439--450 (2020; Zbl 1453.68094)
Full Text: DOI
Kaur, Chamanvir; Misra, Neeldhara
On the parameterized complexity of spanning trees with small vertex covers. (English) Zbl 1453.68096
Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 427-438 (2020).
MSC:  68Q27 05C05 05C85 68Q17 68R10 68W25
PDF BibTeX XML Cite
\textit{C. Kaur} and \textit{N. Misra}, Lect. Notes Comput. Sci. 12016, 427--438 (2020; Zbl 1453.68096)
Full Text: DOI
van Rooij, Sebastiaan B.; van Rooij, Johan M. M.
Algorithms and complexity results for the capacitated vertex cover problem. (English) Zbl 1445.68178
Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 473-489 (2019).
MSC:  68R10 68Q17 68Q27 68W40
PDF BibTeX XML Cite
\textit{S. B. van Rooij} and \textit{J. M. M. van Rooij}, Lect. Notes Comput. Sci. 11376, 473--489 (2019; Zbl 1445.68178)
Full Text: DOI
Kobayashi, Yasuaki; Kojima, Kensuke; Matsubara, Norihide; Sone, Taiga; Yamamoto, Akihiro
Algorithms and hardness results for the maximum balanced connected subgraph problem. (English) Zbl 1435.68240
Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 303-315 (2019).
MSC:  68R10 05C40 05C62 05C85 68Q17 68W40
PDF BibTeX XML Cite
\textit{Y. Kobayashi} et al., Lect. Notes Comput. Sci. 11949, 303--315 (2019; Zbl 1435.68240)
Full Text: DOI
Bliznets, Ivan; Sagunov, Danil
On happy colorings, cuts, and structural parameterizations. (English) Zbl 07173297
Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer (ISBN 978-3-030-30785-1/pbk; 978-3-030-30786-8/ebook). Lecture Notes in Computer Science 11789, 148-161 (2019).
MSC:  68R10
PDF BibTeX XML Cite
\textit{I. Bliznets} and \textit{D. Sagunov}, Lect. Notes Comput. Sci. 11789, 148--161 (2019; Zbl 07173297)
Full Text: DOI
Hatzel, Meike; Rabinovich, Roman; Wiederrecht, Sebastian
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs. (English) Zbl 07173290
Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer (ISBN 978-3-030-30785-1/pbk; 978-3-030-30786-8/ebook). Lecture Notes in Computer Science 11789, 53-65 (2019).
MSC:  68R10
PDF BibTeX XML Cite
\textit{M. Hatzel} et al., Lect. Notes Comput. Sci. 11789, 53--65 (2019; Zbl 07173290)
Full Text: DOI
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav
Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS. (English) Zbl 07152233
Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-24765-2/pbk; 978-3-030-24766-9/ebook). Lecture Notes in Computer Science 11646, 523-537 (2019).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
\textit{D. Lokshtanov} et al., Lect. Notes Comput. Sci. 11646, 523--537 (2019; Zbl 07152233)
Full Text: DOI
Bannach, Max; Berndt, Sebastian
Positive-instance driven dynamic programming for graph searching. (English) Zbl 07152199
Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-24765-2/pbk; 978-3-030-24766-9/ebook). Lecture Notes in Computer Science 11646, 43-56 (2019).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
\textit{M. Bannach} and \textit{S. Berndt}, Lect. Notes Comput. Sci. 11646, 43--56 (2019; Zbl 07152199)
Full Text: DOI
Glinskih, Ludmila; Itsykson, Dmitry
On Tseitin formulas, read-once branching programs and treewidth. (English) Zbl 07121063
van Bevern, René (ed.) et al., Computer science – theory and applications. 14th international computer science symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-19954-8/pbk; 978-3-030-19955-5/ebook). Lecture Notes in Computer Science 11532, 143-155 (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{L. Glinskih} and \textit{D. Itsykson}, Lect. Notes Comput. Sci. 11532, 143--155 (2019; Zbl 07121063)
Full Text: DOI
Hatzel, Meike; Kawarabayashi, Ken-ichi; Kreutzer, Stephan
Polynomial planar directed grid theorem. (English) Zbl 1434.05147
Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1465-1484 (2019).
MSC:  05C83 05C10 05C20 05C45
PDF BibTeX XML Cite
\textit{M. Hatzel} et al., in: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6--9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1465--1484 (2019; Zbl 1434.05147)
Full Text: DOI
Chuzhoy, Julia; Tan, Zihan
Towards tight(er) bounds for the excluded grid theorem. (English) Zbl 1434.05146
Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1445-1464 (2019).
MSC:  05C83
PDF BibTeX XML Cite
\textit{J. Chuzhoy} and \textit{Z. Tan}, in: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6--9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1445--1464 (2019; Zbl 1434.05146)
Full Text: DOI
Pous, Damien; Vignudelli, Valeria
Allegories: decidability and graph homomorphisms. (English) Zbl 1453.18002
Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 829-838 (2018).
MSC:  18A10 03B25 05C25
PDF BibTeX XML Cite
\textit{D. Pous} and \textit{V. Vignudelli}, in: Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9--12, 2018. New York, NY: Association for Computing Machinery (ACM). 829--838 (2018; Zbl 1453.18002)
Full Text: DOI
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian
Parameterized orientable deletion. (English) Zbl 07238979
Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-068-2). LIPIcs – Leibniz International Proceedings in Informatics 101, Article 24, 13 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{T. Hanaka} et al., LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 24, 13 p. (2018; Zbl 07238979)
Full Text: DOI
Feldmann, Andreas Emil; Marx, Dániel
The parameterized hardness of the \(k\)-center problem in transportation networks. (English) Zbl 07238974
Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-068-2). LIPIcs – Leibniz International Proceedings in Informatics 101, Article 19, 13 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{A. E. Feldmann} and \textit{D. Marx}, LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 19, 13 p. (2018; Zbl 07238974)
Full Text: DOI
Sidiropoulos, Anastasios; Singhal, Kritika; Sridhar, Vijay
Fractal dimension and lower bounds for geometric problems. (English) Zbl 07236474
Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-066-8). LIPIcs – Leibniz International Proceedings in Informatics 99, Article 70, 14 p. (2018).
MSC:  68U05
PDF BibTeX XML Cite
\textit{A. Sidiropoulos} et al., LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 70, 14 p. (2018; Zbl 07236474)
Full Text: DOI
Huszár, Kristóf; Spreer, Jonathan; Wagner, Uli
On the treewidth of triangulated 3-manifolds. (English) Zbl 07236450
Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-066-8). LIPIcs – Leibniz International Proceedings in Informatics 99, Article 46, 15 p. (2018).
MSC:  68U05
PDF BibTeX XML Cite
\textit{K. Huszár} et al., LIPIcs -- Leibniz Int. Proc. Inform. 99, Article 46, 15 p. (2018; Zbl 07236450)
Full Text: DOI
Amarilli, Antoine; Monet, Mikaël; Senellart, Pierre
Connecting width and structure in knowledge compilation. (English) Zbl 07229068
Kimelfeld, Benny (ed.) et al., 21st international conference on database theory, ICDT 2018, Vienna, Austria, March 26–29, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-063-7). LIPIcs – Leibniz International Proceedings in Informatics 98, Article 6, 17 p. (2018).
MSC:  68P15
PDF BibTeX XML Cite
\textit{A. Amarilli} et al., LIPIcs -- Leibniz Int. Proc. Inform. 98, Article 6, 17 p. (2018; Zbl 07229068)
Full Text: DOI
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian
Small resolution proofs for QBF using dependency treewidth. (English) Zbl 07228419
Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-062-0). LIPIcs – Leibniz International Proceedings in Informatics 96, Article 28, 15 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 28, 15 p. (2018; Zbl 07228419)
Full Text: DOI
Egri, László; Marx, Dániel; Rzążewski, Paweł
Finding List homomorphisms from bounded-treewidth graphs to reflexive graphs: a complete complexity characterization. (English) Zbl 07228418
Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-062-0). LIPIcs – Leibniz International Proceedings in Informatics 96, Article 27, 15 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{L. Egri} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 27, 15 p. (2018; Zbl 07228418)
Full Text: DOI
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia
Parameterized (approximate) defective coloring. (English) Zbl 07228401
Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-062-0). LIPIcs – Leibniz International Proceedings in Informatics 96, Article 10, 15 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 10, 15 p. (2018; Zbl 07228401)
Full Text: DOI
Dell, Holger; Komusiewicz, Christian; Talmon, Nimrod; Weller, Mathias
The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. (English) Zbl 1443.68220
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 30, 12 p. (2018).
MSC:  68W40 68R10
PDF BibTeX XML Cite
\textit{H. Dell} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 30, 12 p. (2018; Zbl 1443.68220)
Full Text: DOI
van der Zanden, Tom C.; Bodlaender, Hans L.
Computing treewidth on the GPU. (English) Zbl 1443.68213
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 29, 13 p. (2018).
MSC:  68W10 68R10
PDF BibTeX XML Cite
\textit{T. C. van der Zanden} and \textit{H. L. Bodlaender}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 29, 13 p. (2018; Zbl 1443.68213)
Full Text: DOI
Lampis, Michael; Mitsou, Valia
Treewidth with a quantifier alternation revisited. (English) Zbl 1443.68073
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 26, 12 p. (2018).
MSC:  68Q27 68Q15 68Q17 68R07 68R10
PDF BibTeX XML Cite
\textit{M. Lampis} and \textit{V. Mitsou}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 26, 12 p. (2018; Zbl 1443.68073)
Full Text: DOI
Kobayashi, Yasuaki; Ohtsuka, Hiromu; Tamaki, Hisao
An improved fixed-parameter algorithm for one-page crossing minimization. (English) Zbl 1443.68135
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 25, 12 p. (2018).
MSC:  68R10 68Q27 68W05
PDF BibTeX XML Cite
\textit{Y. Kobayashi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 25, 12 p. (2018; Zbl 1443.68135)
Full Text: DOI
Eppstein, David; Kurz, Denis
\(k\)-best solutions of MSO problems on tree-decomposable graphs. (English) Zbl 1443.68127
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 16, 13 p. (2018).
MSC:  68R10 03B70 05C85 68Q25
PDF BibTeX XML Cite
\textit{D. Eppstein} and \textit{D. Kurz}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 16, 13 p. (2018; Zbl 1443.68127)
Full Text: DOI
Bougeret, Marin; Sau, Ignasi
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (English) Zbl 1443.68071
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 10, 13 p. (2018).
MSC:  68Q27 68Q17 68R10
PDF BibTeX XML Cite
\textit{M. Bougeret} and \textit{I. Sau}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 10, 13 p. (2018; Zbl 1443.68071)
Full Text: DOI
Bonnet, Édouard; Brettell, Nick; Kwon, O-joung; Marx, Dániel
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. (English) Zbl 1443.68121
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 7, 13 p. (2018).
MSC:  68R10 68Q17 68Q27
PDF BibTeX XML Cite
\textit{É. Bonnet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 7, 13 p. (2018; Zbl 1443.68121)
Full Text: DOI
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth. (English) Zbl 1443.68120
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 4, 12 p. (2018).
MSC:  68R10 05C83 05C85 68Q27 68W40
PDF BibTeX XML Cite
\textit{J. Baste} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 4, 12 p. (2018; Zbl 1443.68120)
Full Text: DOI
Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M.
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. (English) Zbl 1443.68119
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 3, 12 p. (2018).
MSC:  68R10 68Q17 68Q27
PDF BibTeX XML Cite
\textit{J. Baste} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 3, 12 p. (2018; Zbl 1443.68119)
Full Text: DOI
Bliem, Bernhard
Treewidth in non-ground answer set solving and alliance problems in graphs. (English) Zbl 1428.68210
Rocha, Ricardo (ed.) et al., Technical communications of the 33rd international conference on logic programming, ICLP 2017, August 28 – September 1, 2017, Melbourne, Australia. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 58, Article 12, 12 p. (2018).
MSC:  68R10 68N17 68Q27
PDF BibTeX XML Cite
\textit{B. Bliem}, OASIcs -- OpenAccess Ser. Inform. 58, Article 12, 12 p. (2018; Zbl 1428.68210)
Full Text: DOI
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; Zanden, Tom C. van der
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. (English) Zbl 1427.68353
Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 574-586 (2018).
MSC:  68W05 05C62 05C69 05C83 05C85 68Q17 68R10
PDF BibTeX XML Cite
\textit{M. de Berg} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 574--586 (2018; Zbl 1427.68353)
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
Biographic Reference
all top 3
Software