×

Found 1,743 Documents (Results 1–100)

100
MathJax

Hardness results of connected power domination for bipartite graphs and chordal graphs. (English) Zbl 07550559

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, 653-667 (2021).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

On finding shortest paths in arc-dependent networks. (English) Zbl 1458.90628

Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12176, 249-260 (2020).
MSC:  90C35
PDF BibTeX XML Cite
Full Text: DOI

Probe machine based computing model for solving satisfiability problem. (English) Zbl 07240033

Pan, Linqiang (ed.) et al., Bio-inspired computing: theories and applications. 14th international conference, BIC-TA 2019, Zhengzhou, China, November 22–25, 2019. Revised selected papers. Part II. Singapore: Springer. Commun. Comput. Inf. Sci. 1160, 79-92 (2020).
MSC:  68Q07
PDF BibTeX XML Cite
Full Text: DOI

Packing and covering with segments. (English) Zbl 07224284

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, 198-210 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

P-optimal proof systems for each NP-set but no complete disjoint NP-pairs relative to an oracle. (English) Zbl 07561691

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 47, 14 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Two moves per time step make a difference. (English) Zbl 07561634

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 141, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Deciding whether a grid is a topological subgraph of a planar graph is NP-complete. (English) Zbl 07515210

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, 545-556 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

Complexity and algorithms for semipaired domination in graphs. (English) Zbl 07173538

Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11638, 278-289 (2019).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Complexity of regex crosswords. (English) Zbl 1425.68196

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 215-230 (2019).
MSC:  68Q45 68Q17 68R05
PDF BibTeX XML Cite
Full Text: DOI

Capacitated discrete unit disk cover. (English) Zbl 07117342

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 407-418 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

On the algorithmic complexity of double vertex-edge domination in graphs. (English) Zbl 07117325

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 188-198 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Faster exploration of degree-bounded temporal graphs. (English) Zbl 07378353

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 36, 13 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Design patterns for efficient solutions to \(\mathrm{NP}\)-complete problems in membrane computing. (English) Zbl 07002236

Graciani, Carmen (ed.) et al., Enjoying natural computing. Essays dedicated to Mario de Jesús Pérez-Jiménez on the occasion of his 70th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11270, 237-255 (2018).
MSC:  68Q05 68Q10
PDF BibTeX XML Cite
Full Text: DOI

Finding local genome rearrangements. (English) Zbl 1443.92124

Schwartz, Russell (ed.) et al., 17th international workshop on algorithms in bioinformatics, WABI 2017, Boston, MA, USA, August 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 88, Article 24, 13 p. (2017).
MSC:  92D10 92-08
PDF BibTeX XML Cite
Full Text: DOI

How to choose friends strategically. (English) Zbl 1446.91052

Das, Shantanu (ed.) et al., Structural information and communication complexity. 24th international colloquium, SIROCCO 2017, Porquerolles, France, June 19–22, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10641, 283-302 (2017).
MSC:  91D30 68Q25
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

Classification

all top 3

Software