×

Found 162 Documents (Results 1–100)

The complexity of finding a broadcast center. (English) Zbl 1498.68204

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 57-70 (2021).
PDFBibTeX XMLCite
Full Text: DOI

On list \(k\)-coloring convex bipartite graphs. (English) Zbl 1479.05100

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 15-26 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Weakly modular graphs and nonpositive curvature. (English) Zbl 1475.05001

Memoirs of the American Mathematical Society 1309. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4362-7/pbk, 978-1-4704-6349-6/ebook). vi, 159 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the iterated edge-biclique operator. (English) Zbl 07515213

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, 577-587 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subclasses of circular-arc bigraphs: Helly, normal and proper. (English) Zbl 07515206

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, 497-509 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI

Hybrid tractable classes of constraint problems. (English) Zbl 1482.68107

Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 113-135 (2017).
MSC:  68Q25 68R05 90C27
PDFBibTeX XMLCite
Full Text: DOI

A new construction of broadcast graphs. (English) Zbl 1437.05120

Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 201-211 (2016).
MSC:  05C40 05C35 90B18
PDFBibTeX XMLCite
Full Text: DOI

A fast and effective heuristic for discovering small target sets in social networks. (English) Zbl 1390.91263

Lu, Zaixin (ed.) et al., Combinatorial optimization and applications. 9th international conference, COCOA 2015, Houston, TX, USA, December 18–20, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-26625-1/pbk; 978-3-319-26626-8/ebook). Lecture Notes in Computer Science 9486, 193-208 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs. (English) Zbl 1408.05129

Wang, Jianxin (ed.) et al., Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3–5, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9130, 282-293 (2015).
PDFBibTeX XMLCite
Full Text: DOI

The complexity of conservative valued CSPs. (English) Zbl 1423.68215

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 750-759 (2012).
MSC:  68Q25 90C27
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software