×

Found 814 Documents (Results 1–100)

100
MathJax

Approximation algorithms for hitting subgraphs. (English) Zbl 07495035

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 370-384 (2021).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Approximating the discrete time-cost tradeoff problem with bounded depth. (English) Zbl 1482.90179

Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 30-42 (2021).
MSC:  90C27 90C90
PDF BibTeX XML Cite
Full Text: DOI arXiv

Parameterized algorithms for queue layouts. (English) Zbl 07436606

Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 40-54 (2020).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

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

Reconfiguring \(k\)-path vertex covers. (English) Zbl 07224279

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 133-145 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the parameterized complexity of spanning trees with small vertex covers. (English) Zbl 1453.68096

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, 427-438 (2020).
PDF BibTeX XML Cite
Full Text: DOI

Parameterized dynamic variants of red-blue dominating set. (English) Zbl 1440.68134

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, 236-247 (2020).
MSC:  68Q27 05C69
PDF BibTeX XML Cite
Full Text: DOI

Bilu-Linial stability, certified algorithms and the independent set problem. (English) Zbl 07525444

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 7, 16 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

The parameterised complexity of computing the maximum modularity of a graph. (English) Zbl 07378595

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 9, 14 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Multivariate analysis of orthogonal range searching and graph distances. (English) Zbl 07378590

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 4, 13 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Optimal distributed covering algorithms. (English) Zbl 07298661

Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 104-106 (2019).
MSC:  68M14 68W15
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Exact crossing number parameterized by vertex cover. (English) Zbl 07266125

Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 307-319 (2019).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

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