×

Found 96 Documents (Results 1–96)

The balanced satisfactory partition problem. (English) Zbl 1490.68154

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 322-336 (2021).
MSC:  68R10 05C70 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Structural parameterizations of clique coloring. (English) Zbl 1518.68269

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 49, 15 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Finding a small number of colourful components. (English) Zbl 1514.68204

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 20, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

How to secure matchings against edge failures. (English) Zbl 1528.68296

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 38, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

New results on directed edge dominating set. (English) Zbl 1512.68191

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 67, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Structural parameters, tight bounds, and approximation for \((k,r)\)-center. (English) Zbl 1457.68126

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 50, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Gallai’s conjecture for graphs with treewidth 3. (English) Zbl 1383.05252

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 147-152 (2017).
MSC:  05C70 05C38
PDFBibTeX XMLCite
Full Text: DOI

Combinatorial problems on \(H\)-graphs. (English) Zbl 1378.05051

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 223-229 (2017).
MSC:  05C15 05C69 05C60
PDFBibTeX XMLCite
Full Text: DOI arXiv

Squares of low clique number. (English) Zbl 1356.05102

Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 195-198 (2016).
MSC:  05C69 05C75
PDFBibTeX XMLCite
Full Text: DOI Link

Safe sets in graphs: graph classes and structural parameters. (English) Zbl 1483.68245

Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 241-253 (2016).
PDFBibTeX XMLCite
Full Text: DOI HAL

Maximum matching width: new characterizations and a fast algorithm for dominating set. (English) Zbl 1378.68082

Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 212-223 (2015).
MSC:  68Q25 05C69 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimum size tree-decompositions. (English) Zbl 1347.05158

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 21-27, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI

Many-to-one matchings with lower quotas: algorithms and complexity. (English) Zbl 1386.68114

Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48970-3/pbk; 978-3-662-48971-0/ebook). Lecture Notes in Computer Science 9472, 176-187 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On CLIQUE problem for sparse graphs of large dimension. (English) Zbl 1336.05077

Dudin, Alexander (ed.) et al., Information technologies and mathematical modelling. 13th international scientific conference, named after A. F. Terpugov, ITMM 2014, Anzhero-Sudzhensk, Russia, November 20–22, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-13670-7/pbk; 978-3-319-13671-4/ebook). Communications in Computer and Information Science 487, 69-75 (2014).
MSC:  05C42 05C85 05C69
PDFBibTeX XMLCite
Full Text: DOI

Tree convex bipartite graphs: NP-complete domination, Hamiltonicity and treewidth. (English) Zbl 1407.68198

Chen, Jianer (ed.) et al., Frontiers in algorithmics. 8th international workshop, FAW 2014, Zhangjiajie, China, June 28–30, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8497, 252-263 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Finding induced subgraphs via minimal triangulations. (English) Zbl 1230.68108

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 383-394, electronic only (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Not so easy problems for tree decomposable graphs. (English) Zbl 1231.05252

Acharya, B. D. (ed.) et al., Advances in discrete mathematics and applications: Mysore, 2008. Proceedings of the international conference on discrete mathematics (ICDM 2008), Mysore, India, June 6–10, 2008. Mysore: Ramanujan Mathematical Society (ISBN 978-93-80416-03-8/hbk). Ramanujan Mathematical Society Lecture Notes Series 13, 179-190 (2010).
PDFBibTeX XMLCite
Full Text: arXiv

Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph. (English) Zbl 1274.05449

van Leeuwen, Jan (ed.) et al., SOFSEM 2010: Theory and practice of computer science. 36th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 23–29, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11265-2/pbk). Lecture Notes in Computer Science 5901, 452-464 (2010).
MSC:  05C85 05C70 68W25
PDFBibTeX XMLCite
Full Text: DOI

Implicit branching and parameterized partial cover problems (extended abstract). (English) Zbl 1248.68541

Hariharan, Ramesh (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2008), December 9–11, 2008, Bangalore, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-08-8). LIPIcs – Leibniz International Proceedings in Informatics 2, 1-12, electronic only (2008).
PDFBibTeX XMLCite
Full Text: DOI Link

On the treewidth and pathwidth of biconvex bipartite graphs. (English) Zbl 1198.05144

Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. 4th international conference, TAMC 2007, Shanghai, China, May 22–25, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72503-9/pbk). Lecture Notes in Computer Science 4484, 244-255 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Dominating sets and local treewidth. (English) Zbl 1266.05164

Di Battista, Giuseppe (ed.) et al., Algorithms – ESA 2003. 11th annual European symposium, Budapest, Hungary, September 16–19, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20064-9/pbk). Lect. Notes Comput. Sci. 2832, 221-229 (2003).
MSC:  05C85 05C69 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software