×

Found 66 Documents (Results 1–66)

Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems. (English) Zbl 1499.68395

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 1, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. (English) Zbl 1417.05221

Kratsch, Dieter (ed.) et al., Graph-theoretic concepts in computer science. 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25–27, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8747, 360-371 (2014).
MSC:  05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Using split composition to extend distance-hereditary graphs in a generative way (extended abstract). (English) Zbl 1333.05284

Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 286-297 (2011).
MSC:  05C85 05C75
PDFBibTeX XMLCite
Full Text: DOI

On coloring problems with local constraints. (English) Zbl 1268.05062

Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 215-220 (2009).
MSC:  05C15 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

Probe Ptolemaic graphs. (English) Zbl 1148.05309

Hu, Xiaodong (ed.) et al., Computing and combinatorics. 14th annual international conference, COCOON 2008, Dalian, China, June 27–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69732-9/pbk). Lecture Notes in Computer Science 5092, 468-477 (2008).
MSC:  05C69 05C85
PDFBibTeX XMLCite
Full Text: DOI

Dynamic distance hereditary graphs using split decomposition. (English) Zbl 1193.68191

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 41-51 (2007).
MSC:  68R10 05C12
PDFBibTeX XMLCite
Full Text: DOI

Homogeneously orderable graphs and the Steiner tree problem. (English) Zbl 07810381

Nagl, Manfred (ed.), Graph-theoretic concepts in computer science. 21st international workshop, WG ’95, Aachen, Germany, June 20–22, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 1017, 381-395 (1995).
MSC:  68R10
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