×

Found 936 Documents (Results 1–100)

100
MathJax

Bears with hats and independence polynomials. (English) Zbl 07538584

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 283-295 (2021).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI

Completion to chordal distance-hereditary graphs: a quartic vertex-kernel. (English) Zbl 07538574

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 156-168 (2021).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI

A new lower bound for the eternal vertex cover number of graphs. (English) Zbl 07336092

Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 27-39 (2020).
MSC:  68Rxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium. (English) Zbl 1440.91011

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 627-635 (2020).
MSC:  91A43 05C57 91A68
PDF BibTeX XML Cite
Full Text: DOI

A panorama of positivity. II: Fixed dimension. (English) Zbl 1452.15021

Dales, H. Garth (ed.) et al., Complex analysis and spectral theory. Conference in celebration of Thomas Ransford’s 60th birthday, Laval University, Québec, Canada, May 21–25, 2018. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 743, 109-150 (2020).
PDF BibTeX XML Cite
Full Text: DOI

Linear transformations between colorings in chordal graphs. (English) Zbl 07525461

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 24, 15 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)’s and \((k, \ell)\)-graphs. (English) Zbl 07515194

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 355-367 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

Complexity and algorithms for semipaired domination in graphs. (English) Zbl 07173538

Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11638, 278-289 (2019).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

On chordal and perfect plane triangulations. (English) Zbl 07115822

Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 274-285 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
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