×

Found 1,103 Documents (Results 1–100)

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
PDFBibTeX XMLCite
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
PDFBibTeX XMLCite
Full Text: DOI

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

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:  68R10 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Design patterns for efficient solutions to NP-complete problems in membrane computing. (English) Zbl 1519.68095

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:  68Q07 68Q17
PDFBibTeX XMLCite
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
PDFBibTeX XMLCite
Full Text: DOI

Complexity of the satisfiability problem for multilinear forms over a finite field. (English. Russian original) Zbl 1385.65037

Mosc. Univ. Comput. Math. Cybern. 41, No. 2, 81-88 (2017); translation from Vestn. Mosk. Univ., Ser. XV 2017, No. 2, 30-37 (2017).
MSC:  65F30 15A69 15B33
PDFBibTeX XMLCite
Full Text: DOI

On relationships between complexity classes of Turing machines. (English. Russian original) Zbl 1382.68085

Comput. Math. Math. Phys. 57, No. 4, 726-738 (2017); translation from Zh. Vychisl. Mat. Mat. Fiz. 57, No. 4, 730-743 (2017).
MSC:  68Q15 68Q05
PDFBibTeX XMLCite
Full Text: DOI

Free-variable semantic tableaux for the logic of fuzzy inequalities. (English. Russian original) Zbl 1386.03025

Algebra Logic 55, No. 2, 103-127 (2016); translation from Algebra Logika 55, No. 2, 156-191 (2016); erratum ibid. 55, No. 3, 256 (2016).
MSC:  03B52 03F03 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Orthology relation and gene tree correction: complexity results. (English) Zbl 1367.92086

Pop, Mihai (ed.) et al., Algorithms in bioinformatics. 15th international workshop, WABI 2015, Atlanta, GA, USA, September 10–12, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48220-9/pbk; 978-3-662-48221-6/ebook). Lecture Notes in Computer Science 9289. Lecture Notes in Bioinformatics, 66-79 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Stable marriage with general preferences. Extended abstract. (English) Zbl 1403.91258

Lavi, Ron (ed.), Algorithmic game theory. 7th international symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings. Berlin: Springer (ISBN 978-3-662-44802-1/pbk). Lecture Notes in Computer Science 8768, 25-36 (2014).
PDFBibTeX XMLCite
Full Text: DOI

A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems. (English. Russian original) Zbl 1298.90083

Cybern. Syst. Anal. 50, No. 1, 1-7 (2014); translation from Kibern. Sist. Anal. 2014, No. 1, 3-10 (2014).
MSC:  90C27 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Tree convex bipartite graphs: NP-complete domination, Hamiltonicity and treewidth. (English) Zbl 1407.68198

Chen, Jianer (ed.) et al., Frontiers in algorithmics. 8th international workshop, FAW 2014, Zhangjiajie, China, June 28–30, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8497, 252-263 (2014).
PDFBibTeX XMLCite
Full Text: DOI

The computational complexity and approximability of a series of geometric covering problems. (English. Russian original) Zbl 1317.68075

Proc. Steklov Inst. Math. 283, Suppl. 1, S64-S77 (2013); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 18, No. 3, 247-260 (2012).
MSC:  68Q25 68Q17 68U05
PDFBibTeX XMLCite
Full Text: DOI

Algorithms and almost tight results for 3-colorability of small diameter graphs. (English) Zbl 1303.68074

van Emde Boas, Peter (ed.) et al., SOFSEM 2013: theory and practice of computer science. 39th international conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 26–31, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-35842-5/pbk). Lecture Notes in Computer Science 7741, 332-343 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software