×

Found 123 Documents (Results 1–100)

100
MathJax

Finding optimal solutions with neighborly help. (English) Zbl 07561722

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

On the complexity of the vertex 3-coloring problem for the hereditary graph classes with forbidden subgraphs of small size. (Russian, English) Zbl 1438.05105

Diskretn. Anal. Issled. Oper. 25, No. 4, 112-130 (2018); translation in J. Appl. Ind. Math. 12, No. 4, 759-769 (2018).
MSC:  05C15 68Q17 68W25
PDF BibTeX XML Cite
Full Text: DOI

On twisted knots. (English) Zbl 1354.57015

Gongopadhyay, Krishnendu (ed.) et al., Knot theory and its applications. ICTS program knot theory and its applications (KTH-2013), IISER Mohali, India, December 10–20, 2013. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2257-8/pbk; 978-1-4704-3526-4/ebook). Contemporary Mathematics 670, 313-325 (2016).
MSC:  57M25 57M27
PDF BibTeX XML Cite
Full Text: DOI

Colorings of partial Steiner systems and their applications. (English. Russian original) Zbl 1317.05096

J. Math. Sci., New York 206, No. 5, 511-538 (2015); translation from Fundam. Prikl. Mat. 18, No. 3, 77-115 (2013).
PDF BibTeX XML Cite
Full Text: DOI

Computation with polynomial equations and inequalities arising in combinatorial optimization. (English) Zbl 1242.90191

Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17–21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 447-481 (2012).
MSC:  90C27 90C22 68W05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Defining languages by forbidding-enforcing systems. (English) Zbl 1344.68118

Löwe, Benedikt (ed.) et al., Models of computation in context. 7th conference on computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 – July 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21874-3/pbk). Lecture Notes in Computer Science 6735, 92-101 (2011).
MSC:  68Q45 68Q05
PDF BibTeX XML Cite
Full Text: DOI

Inapproximability of \(b\)-matching in \(k\)-uniform hypergraphs. (English) Zbl 1317.68068

Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18–20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 57-69 (2011).
PDF BibTeX XML Cite
Full Text: DOI

Comparing the strength of query types in property testing: the case of testing \(k\)-colorability. (English) Zbl 1309.68215

Goldreich, Oded (ed.), Property testing. Current research and surveys. Berlin: Springer (ISBN 978-3-642-16366-1/pbk). Lecture Notes in Computer Science 6390, 253-259 (2010).
MSC:  68W20 05C15 68R10
PDF BibTeX XML Cite
Full Text: DOI

Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck. (English) Zbl 1273.05174

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 191-198 (2009).
MSC:  05C70
PDF BibTeX XML Cite
Full Text: DOI

DP-complete problems derived from extremal NP-complete properties. (English) Zbl 1250.68118

Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 199-210 (2009).
MSC:  68Q17
PDF BibTeX XML Cite
Full Text: DOI

3-colorability \(\in\mathrm{P}\) for \(P_{6}\)-free graphs. (English) Zbl 1409.05090

Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 85-89 (2001).
PDF BibTeX XML Cite
Full Text: Link

Relating partial and complete solutions and the complexity of computing smallest solutions. (English) Zbl 1042.68605

Restivo, Antonio (ed.) et al., Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4–6, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42672-8). Lect. Notes Comput. Sci. 2202, 339-356 (2001).
MSC:  68Q25 68Q17 68R10
PDF BibTeX XML Cite
Full Text: Link

Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability. (English) Zbl 0955.05099

Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 49-55 (1999).
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

Software