×

Found 1,339 Documents (Results 1–100)

On the approximability and hardness of the minimum connected dominating set with routing cost constraint. (English) Zbl 1522.68079

Gilbert, Seth (ed.) et al., Algorithms for sensor systems. 14th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11410, 32-46 (2019).
MSC:  68M18 68R10 68W25
PDFBibTeX XMLCite
Full Text: DOI

A comparison of type theory with set theory. (English) Zbl 1528.03109

Centrone, Stefania (ed.) et al., Reflections on the foundations of mathematics. Univalent foundations, set theory and general thoughts. Based on the conference on foundations of mathematics: univalent foundations and set theory, FOMUS, Bielefeld, Germany, July 18–23, 2016. Cham: Springer. Synth. Libr. 407, 271-292 (2019).
MSC:  03B38 03E99
PDFBibTeX XMLCite
Full Text: DOI

Set theory and structures. (English) Zbl 1528.03011

Centrone, Stefania (ed.) et al., Reflections on the foundations of mathematics. Univalent foundations, set theory and general thoughts. Based on the conference on foundations of mathematics: univalent foundations and set theory, FOMUS, Bielefeld, Germany, July 18–23, 2016. Cham: Springer. Synth. Libr. 407, 223-253 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Proving theorems from reflection. (English) Zbl 1528.03211

Centrone, Stefania (ed.) et al., Reflections on the foundations of mathematics. Univalent foundations, set theory and general thoughts. Based on the conference on foundations of mathematics: univalent foundations and set theory, FOMUS, Bielefeld, Germany, July 18–23, 2016. Cham: Springer. Synth. Libr. 407, 79-97 (2019).
MSC:  03E55 03E35 03E30
PDFBibTeX XMLCite
Full Text: DOI

Maddy on the multiverse. (English) Zbl 1528.03072

Centrone, Stefania (ed.) et al., Reflections on the foundations of mathematics. Univalent foundations, set theory and general thoughts. Based on the conference on foundations of mathematics: univalent foundations and set theory, FOMUS, Bielefeld, Germany, July 18–23, 2016. Cham: Springer. Synth. Libr. 407, 43-78 (2019).
MSC:  03A05 00A30 03E99
PDFBibTeX XMLCite
Full Text: DOI

New distance and similarity measures for Pythagorean fuzzy sets and their applications in pattern recognition. (English) Zbl 1528.03220

Kimura, Yasunori (ed.) et al., Proceedings of the 11th international conference on nonlinear analysis and convex analysis (NACA 2019) and the International conference on optimization: techniques and applications (ICOTA), Hokodate, Japan, August 26–31, 2019. Part I. Yokohama: Yokohama Publishers. 243-266 (2019).
MSC:  03E72 68T10 68T37
PDFBibTeX XMLCite
Full Text: Link

Subexponential-time algorithms for finding large induced sparse subgraphs. (English) Zbl 1515.68252

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 23, 11 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Improved analysis of highest-degree branching for feedback vertex set. (English) Zbl 1515.68245

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 22, 11 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

The complexity of symmetry breaking in massive graphs. (English) Zbl 1515.68248

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 26, 18 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond. (English) Zbl 1515.68372

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 18, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal distributed covering algorithms. (English) Zbl 1515.68358

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 5, 15 p. (2019).
MSC:  68W15 68R10 68W25
PDFBibTeX XMLCite
Full Text: DOI

A formalization of forcing and the unprovability of the continuum hypothesis. (English) Zbl 07649968

Harrison, John (ed.) et al., 10th international conference on interactive theorem proving, ITP 2019, September 9–12, 2019, Portland, OR, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 141, Article 19, 19 p. (2019).
MSC:  68V20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Some remarks by Kurt Gödel on set theory. (Einige Bemerkungen Kurt Gödels zur Mengenlehre.) (German) Zbl 1510.03002

Koenig, Daniel (ed.) et al., Mathematik in der Tradition des Neukantianismus. Siegen: universi – Universitaetsverlag Siegen. Siegen. Beitr. Gesch. Philos. Math. 11, 143-169 (2019).
PDFBibTeX XMLCite

Domination above \(r\)-independence: does sparseness help? (English) Zbl 07561684

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 40, 13 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Faster FPT algorithm for 5-path vertex cover. (English) Zbl 07561676

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 32, 13 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Distributed minimum vertex coloring and maximum independent set in chordal graphs. (English) Zbl 07561665

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 21, 15 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Distributed reconfiguration of maximal independent sets. (English) Zbl 07561628

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 135, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Computing optimal \(\varepsilon\)-nets is as easy as finding an unhit set. (English) Zbl 07561580

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 87, 12 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A simple gap-producing reduction for the parameterized set cover problem. (English) Zbl 1527.68164

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 81, 15 p. (2019).
MSC:  68R10 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Decomposition of map graphs with applications. (English) Zbl 07561553

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 60, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Covering vectors by spaces in perturbed graphic matroids and their duals. (English) Zbl 07561552

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 59, 13 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Independent sets in vertex-arrival streams. (English) Zbl 1517.68285

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 45, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

When algorithms for maximal independent set and maximal matching run in sublinear time. (English) Zbl 07561510

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 17, 17 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fine-grained reductions and quantum speedups for dynamic programming. (English) Zbl 07561501

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 8, 13 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Template games, simple games, and day convolution. (English) Zbl 1528.91022

Geuvers, Herman (ed.), 4th international conference on formal structures for computation and deduction, FSCD 2019, Dortmund, Germany, June 24–30, 2019. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 131, Article 16, 19 p. (2019).
MSC:  91A44 18N10 68Q55
PDFBibTeX XMLCite
Full Text: DOI

The set cover conjecture and subgraph isomorphism with a tree pattern. (English) Zbl 07559154

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 45, 15 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On kernelization for edge dominating set under structural parameters. (English) Zbl 07559145

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 36, 18 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Dominating sets and connected dominating sets in dynamic graphs. (English) Zbl 07559144

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 35, 17 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Progressive algorithms for domination and independence. (English) Zbl 07559136

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 27, 16 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Enumerating minimal dominating sets in triangle-free graphs. (English) Zbl 07559125

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 16, 12 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Token sliding on split graphs. (English) Zbl 1517.68274

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 13, 17 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Being corrupt requires being clever, but detecting corruption doesn’t. (English) Zbl 07559088

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 45, 14 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A log-Sobolev inequality for the multislice, with applications. (English) Zbl 07559077

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 34, 12 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Capturing complementarity in set functions by going beyond submodularity/subadditivity. (English) Zbl 07559067

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 24, 20 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Small-set expansion in shortcode graph and the 2-to-2 conjecture. (English) Zbl 1518.68136

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 9, 12 p. (2019).
MSC:  68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Identifying codes in the complementary prism of cycles. (English) Zbl 07515184

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, 241-251 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations. (English) Zbl 07515175

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, 135-145 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI

A characterization of claw-free CIS graphs and new results on the order of CIS graphs. (English) Zbl 07515165

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, 15-27 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Characterizations of supercontinuous posets via Scott \(S\)-sets and the \(S\)-essential topology. (English) Zbl 07513479

Jung, Achim (ed.) et al., Proceedings of the 8th international symposium on domain theory and its applications, ISDT 2019, Yangzhou, China, June 14–17, 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 345, 169-183 (2019).
MSC:  68Q55
PDFBibTeX XMLCite
Full Text: DOI

Universal approach to \(Z\)-frame envelopes of semilattices. (English) Zbl 07513474

Jung, Achim (ed.) et al., Proceedings of the 8th international symposium on domain theory and its applications, ISDT 2019, Yangzhou, China, June 14–17, 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 345, 87-97 (2019).
MSC:  68Q55
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

Biographic Reference