×

Found 1,544 Documents (Results 1–100)

Complexity of paired domination in at-free and planar graphs. (English) Zbl 07683163

Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 65-77 (2022).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Techniques for designing and analyzing algorithms. (English) Zbl 1486.68003

Chapman & Hall/CRC Cryptography and Network Security. Boca Raton, FL: CRC Press (ISBN 978-0-367-22889-7/hbk; 978-1-032-02410-3/pbk; 978-0-429-27741-2/ebook). xiv, 430 p. (2022).
PDF BibTeX XML Cite
Full Text: DOI

Approximation algorithm and hardness results for defensive domination in graphs. (English) Zbl 07550529

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 247-261 (2021).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

Fair division is hard even for amicable agents. (English) Zbl 1492.91160

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 421-430 (2021).
MSC:  91B32 68Q17
PDF BibTeX XML Cite
Full Text: DOI

Edge tree spanners. (English) Zbl 1479.05052

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, 195-207 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Mathematical characterizations and computational complexity of anti-slide puzzles. (English) Zbl 1498.68358

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 321-332 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Upward point set embeddings of paths and trees. (English) Zbl 07405965

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 234-246 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the complexity of minimum maximal uniquely restricted matching. (English) Zbl 07666361

Wu, Weili (ed.) et al., Combinatorial optimization and applications. 14th international conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12577, 364-376 (2020).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

Finding the anticover of a string. (English) Zbl 07651093

Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 2, 11 p. (2020).
MSC:  68W32 68Q17 68W40
PDF BibTeX XML Cite
Full Text: DOI

Near-optimal complexity bounds for fragments of the Skolem problem. (English) Zbl 07650922

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 37, 18 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

On covering segments with unit intervals. (English) Zbl 07650898

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 13, 17 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Approaching MCSP from above and below: hardness for a conditional variant and AC\(^0[p]\). (English) Zbl 07650382

Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 34, 26 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Strongly stable and maximum weakly stable noncrossing matchings. (English) Zbl 07601016

Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 304-315 (2020).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

LaserTank is NP-complete. (English) Zbl 07441080

Slamanig, Daniel (ed.) et al., Mathematical aspects of computer and information sciences. 8th international conference, MACIS 2019, Gebze, Turkey, November 13–15, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11989, 333-338 (2020).
MSC:  68-XX 65-XX
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the complexity of some quadratic Euclidean partition problems into balanced clusters. (English) Zbl 1477.90085

Jaćimović, Milojica (ed.) et al., Optimization and applications. 10th international conference, OPTIMA 2019, Petrovac, Montenegro, September 30 – October 4, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1145, 127-136 (2020).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI

Realization problems on reachability sequences. (English) Zbl 1477.68219

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, 274-286 (2020).
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

Main Field

Biographic Reference

all top 3

Software