×

zbMATH — the first resource for mathematics

Found 395 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Miasnikov, Alexei; Nikolaev, Andrey
On parameterized complexity of the word search problem in the Baumslag-Gersten group. (English) Zbl 07300092
Mantzaflaris, Angelos (ed.), Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC ’20, Kalamata, Greece, July 20–23, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7100-1). 360-363 (2020).
MSC:  68W30
PDF BibTeX XML Cite
\textit{A. Miasnikov} and \textit{A. Nikolaev}, in: Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC '20, Kalamata, Greece, July 20--23, 2020. New York, NY: Association for Computing Machinery (ACM). 360--363 (2020; Zbl 07300092)
Full Text: DOI
Steiner, Raphael; Wiederrecht, Sebastian
Parameterized algorithms for directed modular width. (English) Zbl 07223713
Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39218-5/pbk; 978-3-030-39219-2/ebook). Lecture Notes in Computer Science 12016, 415-426 (2020).
MSC:  68Q27 05C85 68R10 68W25
PDF BibTeX XML Cite
\textit{R. Steiner} and \textit{S. Wiederrecht}, Lect. Notes Comput. Sci. 12016, 415--426 (2020; Zbl 07223713)
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
Bhore, Sujoy; Jana, Satyabrata; Pandit, Supantha; Roy, Sasanka
Balanced connected subgraph problem in geometric intersection graphs. (English) Zbl 1434.68347
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, 56-68 (2019).
MSC:  68R10 05C15 05C62 68Q17 68W40
PDF BibTeX XML Cite
\textit{S. Bhore} et al., Lect. Notes Comput. Sci. 11949, 56--68 (2019; Zbl 1434.68347)
Full Text: DOI
Kobayashi, Yasuaki; Kobayashi, Yusuke; Miyazaki, Shuichi; Tamaki, Suguru
An improved fixed-parameter algorithm for max-cut parameterized by crossing number. (English) Zbl 07173542
Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-25004-1/pbk; 978-3-030-25005-8/ebook). Lecture Notes in Computer Science 11638, 327-338 (2019).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
\textit{Y. Kobayashi} et al., Lect. Notes Comput. Sci. 11638, 327--338 (2019; Zbl 07173542)
Full Text: DOI
Bousquet, Nicolas; Hatanaka, Tatsuhiko; Ito, Takehiro; Mühlenthaler, Moritz
Shortest reconfiguration of matchings. (English) Zbl 07173298
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, 162-174 (2019).
MSC:  68R10
PDF BibTeX XML Cite
\textit{N. Bousquet} et al., Lect. Notes Comput. Sci. 11789, 162--174 (2019; Zbl 07173298)
Full Text: DOI
Bergé, Pierre; Mouscadet, Benjamin; Rimmel, Arpad; Tomasik, Joanna
Fixed-parameter tractability of counting small minimum \((S,T)\)-cuts. (English) Zbl 07173292
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, 79-92 (2019).
MSC:  68R10
PDF BibTeX XML Cite
\textit{P. Bergé} et al., Lect. Notes Comput. Sci. 11789, 79--92 (2019; Zbl 07173292)
Full Text: DOI
Jansen, Bart M. P.; Kozma, László; Nederlof, Jesper
Hamiltonicity below Dirac’s condition. (English) Zbl 07173288
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, 27-39 (2019).
MSC:  68R10
PDF BibTeX XML Cite
\textit{B. M. P. Jansen} et al., Lect. Notes Comput. Sci. 11789, 27--39 (2019; Zbl 07173288)
Full Text: DOI
Bodlaender, Hans L.; Kolay, Sudeshna; Pieterse, Astrid
Parameterized complexity of conflict-free graph coloring. (English) Zbl 07152208
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, 168-180 (2019).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
\textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 11646, 168--180 (2019; Zbl 07152208)
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
Bannach, Max; Skambath, Malte; Tantau, Till
Towards work-efficient parallel parameterized algorithms. (English) Zbl 07117337
Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-10563-1/pbk; 978-3-030-10564-8/ebook). Lecture Notes in Computer Science 11355, 341-353 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{M. Bannach} et al., Lect. Notes Comput. Sci. 11355, 341--353 (2019; Zbl 07117337)
Full Text: DOI
Fertin, Guillaume; Fradin, Julien; Komusiewicz, Christian
On the maximum colorful arborescence problem and color hierarchy graph structure. (English) Zbl 07286743
Navarro, Gonzalo (ed.) et al., 29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-074-3). LIPIcs – Leibniz International Proceedings in Informatics 105, Article 17, 15 p. (2018).
MSC:  68W32
PDF BibTeX XML Cite
\textit{G. Fertin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 105, Article 17, 15 p. (2018; Zbl 07286743)
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
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
Bannach, Max; Tantau, Till
Computing hitting set kernels by \(\mathsf{AC}^0\)-circuits. (English) Zbl 07228400
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 9, 14 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{M. Bannach} and \textit{T. Tantau}, LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 9, 14 p. (2018; Zbl 07228400)
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
Hliněný, Petr; Pokrývka, Filip; Roy, Bodhayan
FO model checking of geometric graphs. (English) Zbl 1443.68105
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 19, 12 p. (2018).
MSC:  68Q60 03B10 05C62 68Q27 68R10
PDF BibTeX XML Cite
\textit{P. Hliněný} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 19, 12 p. (2018; Zbl 1443.68105)
Full Text: DOI
Fichte, Johannes K.; Hecher, Markus; Morak, Michael; Woltran, Stefan
DynASP2.5: dynamic programming on tree decompositions in action. (English) Zbl 1443.68164
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 17, 13 p. (2018).
MSC:  68T20 68N17 68Q27 68W05 90C39
PDF BibTeX XML Cite
\textit{J. K. Fichte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 17, 13 p. (2018; Zbl 1443.68164)
Full Text: DOI
Chandrasekaran, Karthekeyan; Mozaffari, Sahand
Odd multiway cut in directed acyclic graphs. (English) Zbl 1443.68124
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 12, 12 p. (2018).
MSC:  68R10 68Q27 68W25
PDF BibTeX XML Cite
\textit{K. Chandrasekaran} and \textit{S. Mozaffari}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 12, 12 p. (2018; Zbl 1443.68124)
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
Agrawal, Akanksha; Saurabh, Saket; Tale, Prafullkumar
On the parameterized complexity of contraction to generalization of trees. (English) Zbl 1435.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 1, 12 p. (2018).
MSC:  68Q27 05C85 68R10
PDF BibTeX XML Cite
\textit{A. Agrawal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 1, 12 p. (2018; Zbl 1435.68120)
Full Text: DOI
Sitchinava, Nodari; Strash, Darren
Reconstructing generalized staircase polygons with uniform step length. (English) Zbl 07026980
Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer (ISBN 978-3-319-73914-4/pbk; 978-3-319-73915-1/ebook). Lecture Notes in Computer Science 10692, 88-101 (2018).
MSC:  68R10 68U05
PDF BibTeX XML Cite
\textit{N. Sitchinava} and \textit{D. Strash}, Lect. Notes Comput. Sci. 10692, 88--101 (2018; Zbl 07026980)
Full Text: DOI
Jaffke, Lars; de Oliveira Oliveira, Mateus
On weak isomorphism of rooted vertex-colored graphs. (English) Zbl 06983012
Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer (ISBN 978-3-030-00255-8/pbk; 978-3-030-00256-5/ebook). Lecture Notes in Computer Science 11159, 266-278 (2018).
MSC:  68R10
PDF BibTeX XML Cite
\textit{L. Jaffke} and \textit{M. de Oliveira Oliveira}, Lect. Notes Comput. Sci. 11159, 266--278 (2018; Zbl 06983012)
Full Text: DOI
Bustamante, Luis Henrique; Martins, Ana Teresa; Martins, Francicleber Ferreira
Parameterized complexity of some prefix-vocabulary fragments of first-order logic. (English) Zbl 06958312
Moss, Lawrence S. (ed.) et al., Logic, language, information, and computation. 25th international workshop, WoLLIC 2018, Bogota, Colombia, July 24–27, 2018. Proceedings. Berlin: Springer (ISBN 978-3-662-57668-7/pbk; 978-3-662-57669-4/ebook). Lecture Notes in Computer Science 10944, 163-178 (2018).
MSC:  03B70
PDF BibTeX XML Cite
\textit{L. H. Bustamante} et al., Lect. Notes Comput. Sci. 10944, 163--178 (2018; Zbl 06958312)
Full Text: DOI
Cohen, Nathann; Havet, Frédéric; Mazauric, Dorian; Sau, Ignasi; Watrigant, Rémi
Complexity dichotomies for the Minimum \(\mathcal{F}\)-Overlay problem. (English) Zbl 06890112
Brankovic, Ljiljana (ed.) et al., Combinatorial algorithms. 28th international workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17–21, 2017. Revised selected papers. Cham: Springer (ISBN 978-3-319-78824-1/pbk; 978-3-319-78825-8/ebook). Lecture Notes in Computer Science 10765, 116-127 (2018).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
\textit{N. Cohen} et al., Lect. Notes Comput. Sci. 10765, 116--127 (2018; Zbl 06890112)
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
all top 3
Software