×

Found 1,329 Documents (Results 101–200)

Brief announcement: local certification of graph decompositions and applications to minor-free classes. (English) Zbl 07774300

Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 49, 4 p. (2021).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Testing Hamiltonicity (And Other Problems) in minor-free graphs. (English) Zbl 07768406

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 61, 23 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Clan embeddings into trees, and low treewidth graphs. (English) Zbl 07765176

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 342-355 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On a two-dimensional exponential sum. (English) Zbl 1521.11053

Nathanson, Melvyn B. (ed.), Combinatorial and additive number theory IV. Selected papers based on the presentations at the CANT 2019 and 2020 workshops, New York, NY, USA, May 21–24, 2019 and virtual, June 1–5, 2020. Cham: Springer. Springer Proc. Math. Stat. 347, 371-383 (2021).
MSC:  11L15 11P55
PDFBibTeX XMLCite
Full Text: DOI

How to catch marathon cheaters: new approximation algorithms for tracking paths. (English) Zbl 07498695

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 442-456 (2021).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Linear transformations between dominating sets in the TAR-model. (English) Zbl 07765395

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 37, 14 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the parameterized complexity of the expected coverage problem. (English) Zbl 07603924

Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 224-236 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Multi-channel structure selection model for minor enterprises. (English) Zbl 1471.90007

Li, Xiang (ed.) et al., Proceedings of the seventh international forum on decision sciences, Windsor, Canada. Singapore: Springer. Uncertain. Oper. Res., 11-20 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Hitting topological minors is FPT. (English) Zbl 07298330

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 1317-1326 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Nonzero periodic solutions of a special system of nonlinear differential equations. (English. Russian original) Zbl 1452.34047

J. Math. Sci., New York 248, No. 4, 467-475 (2020); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 148, 93-100 (2018).
MSC:  34C25 37C60 47N20
PDFBibTeX XMLCite
Full Text: DOI

Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration. (English) Zbl 07224285

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, 211-222 (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Recent progress on well-quasi-ordering graphs. (English) Zbl 1443.05177

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 161-188 (2020).
MSC:  05C99 06A06 05C20
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field