×

Found 221 Documents (Results 1–100)

Partitioning cographs into two forests and one independent set. (English) Zbl 1460.05155

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, 15-27 (2020).
MSC:  05C70 05C75 05C69
PDFBibTeX XMLCite
Full Text: DOI

Interval-like graphs and digraphs. (English) Zbl 1494.68195

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 68, 13 p. (2018).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Correspondence homomorphisms to reflexive graphs. (English) Zbl 1383.05212

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, 9-14 (2017).
MSC:  05C60 05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Hamiltonian cycles in covering graphs of trees. (English) Zbl 1474.05233

Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10628, 261-275 (2017).
MSC:  05C45
PDFBibTeX XMLCite
Full Text: DOI

Minimum cost homomorphisms with constrained costs. (English) Zbl 1476.68110

Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 194-206 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. (English) Zbl 1371.05244

Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 1708-1727 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Space complexity of list \(H\)-colouring: a dichotomy. (English) Zbl 1421.68073

Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 349-365 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Intersection dimension of bipartite graphs. (English) Zbl 1406.05084

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). Lecture Notes in Computer Science 8402, 323-340 (2014).
MSC:  05C75 05C62 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Complexity of coloring graphs without paths and cycles. (English) Zbl 1405.68140

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 538-549 (2014).
MSC:  68Q25 05C15 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Influence diffusion in social networks under time window constraints. (English) Zbl 1408.91176

Moscibroda, Thomas (ed.) et al., Structural information and communication complexity. 20th international colloquium, SIROCCO 2013, Ischia, Italy, July 1–3, 2013. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8179, 141-152 (2013).
MSC:  91D30 91-04 05C85
PDFBibTeX XMLCite
Full Text: DOI

Small \(H\)-coloring problems for bounded degree digraphs. (English) Zbl 1382.68111

Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 579-590 (2013).
MSC:  68Q25 05C15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Counting partitions of graphs. (English) Zbl 1260.68176

Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 227-236 (2012).
MSC:  68Q25 05C70 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Approximation of minimum cost homomorphisms. (English) Zbl 1365.05203

Epstein, Leah (ed.) et al., Algorithms – ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 587-598 (2012).
PDFBibTeX XMLCite
Full Text: DOI

The dichotomy of list homomorphisms for digraphs. (English) Zbl 1376.68067

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1703-1713 (2011).
PDFBibTeX XMLCite
Full Text: Link

Partitioning chordal graphs. (English) Zbl 1274.05376

Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 325-330 (2011).
MSC:  05C70 05C50
PDFBibTeX XMLCite
Full Text: Link

Cycle transversals in bounded degree graphs. (English) Zbl 1268.05200

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, 189-195 (2009).
MSC:  05C85
PDFBibTeX XMLCite
Full Text: DOI Link

Adjusted interval digraphs. (English) Zbl 1267.05257

Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 83-91 (2009).
MSC:  05C85 05C20
PDFBibTeX XMLCite
Full Text: DOI

Generalized colourings and matrix partitions. (English) Zbl 1181.05042

Balakrishnan, R. (ed.) et al., Proceedings of the international conference on discrete mathematics (ICDM 2006), Bangalore, India, December 15–18, 2006. Mysore: Ramanujan Mathematical Society (ISBN 978-81-902545-7-1/hbk). Ramanujan Mathematical Society Lecture Notes Series 7, 141-148 (2008).
MSC:  05C15 05-02
PDFBibTeX XMLCite

On injective colourings of chordal graphs. (English) Zbl 1136.68463

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 520-530 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Minimum cost homomorphisms to reflexive digraphs. (English) Zbl 1136.68462

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 182-193 (2008).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Matrix partitions with finitely many obstructions. (English) Zbl 1158.05325

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 371-378 (2007).
MSC:  05C50 15A99 05C75
PDFBibTeX XMLCite
Full Text: DOI

Generalized colouring (matrix partitions) of cographs. (English) Zbl 1114.05060

Bondy, Adrian (ed.) et al., Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser (ISBN 3-7643-7228-1/hbk). Trends in Mathematics, 149-167 (2007).
MSC:  05C50 05C15
PDFBibTeX XMLCite

Two algorithms for general list matrix partitions. (English) Zbl 1297.68091

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 870-876 (2005).
MSC:  68Q25 05C70 05C85
PDFBibTeX XMLCite

List partitions of chordal graphs. (English) Zbl 1196.05060

Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 100-108 (2004).
MSC:  05C69 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Counting list homomorphisms for graphs with bounded degrees. (English) Zbl 1059.05049

Nešetřil, J. (ed.) et al., Graphs, morphisms and statistical physics. Proceedings of the workshop held at Rutgers University, Piscataway, NJ, USA, March 19–21, 2001. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3551-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 63, 105-112 (2004).
MSC:  05C15 05C85 68R10
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

Software