×

Found 1,350 Documents (Results 1–100)

Maximum edge colouring problem on graphs that exclude a fixed minor. (English) Zbl 07842219

Paulusma, Daniël (ed.) et al., Graph-theoretic concepts in computer science. 49th international workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 14093, 291-304 (2023).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Deciding the Erdős-Pósa property in 3-connected digraphs. (English) Zbl 07842203

Paulusma, Daniël (ed.) et al., Graph-theoretic concepts in computer science. 49th international workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 14093, 59-71 (2023).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs. (English) Zbl 1531.68048

Gąsieniec, Leszek (ed.), SOFSEM 2023: theory and practice of computer science. 48th international conference on current trends in theory and practice of computer science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13878, 283-297 (2023).
MSC:  68R10 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing connected-\(k\)-subgraph cover with connectivity requirement. (English) Zbl 07722834

Du, Ding-Zhu (ed.) et al., Theory and applications of models of computation. 17th annual conference, TAMC 2022, Tianjin, China, September 16–18, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13571, 93-102 (2023).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Testability and local certification of monotone properties in minor-closed classes. (English) Zbl 07870268

Bojańczyk, Mikołaj (ed.) et al., 49th EATCS international conference on automata, languages, and programming, ICALP 2022, Paris, France, July 4–8, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 229, Article 58, 15 p. (2022).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On comparable box dimension. (English) Zbl 07849036

Goaoc, Xavier (ed.) et al., 38th international symposium on computational geometry, SoCG 2022, Berlin, Germany, June 7–10, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 224, Article 38, 14 p. (2022).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\). (English) Zbl 07836607

Berenbrink, Petra (ed.) et al., 39th international symposium on theoretical aspects of computer science, STACS 2022, Marseille, France, virtual conference, March 15–18, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 219, Article 40, 14 p. (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Local certification of graph decompositions and applications to minor-free classes. (English) Zbl 07832763

Bramas, Quentin (ed.) et al., 25th international conference on principles of distributed systems, OPODIS 2021, Strasbourg, France, December 13–15, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 217, Article 22, 17 p. (2022).
MSC:  68M14 68M20
PDFBibTeX XMLCite
Full Text: DOI

Explicit space-time tradeoffs for proof labeling schemes in graphs with small separators. (English) Zbl 07832762

Bramas, Quentin (ed.) et al., 25th international conference on principles of distributed systems, OPODIS 2021, Strasbourg, France, December 13–15, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 217, Article 21, 22 p. (2022).
MSC:  68M14 68M20
PDFBibTeX XMLCite
Full Text: DOI

Universally-optimal distributed exact min-cut. (English) Zbl 07824275

Milani, Alessia (ed.) et al., Proceedings of the 41st ACM symposium on principles of distributed computing, PODC ’22, Salerno, Italy, July 25–29, 2022. New York, NY: Association for Computing Machinery (ACM). 281-291 (2022).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Explicit bounds for graph minors. (English) Zbl 1529.05146

Nixon, Anthony (ed.) et al., Surveys in combinatorics 2022. Papers based on the 29th British combinatorial conference, Lancaster University, Lancaster, UK, July 11–15, 2022. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 481, 215-236 (2022).
MSC:  05C83
PDFBibTeX XMLCite
Full Text: DOI arXiv

Locality-sensitive orderings and applications to reliable spanners. (English) Zbl 07774400

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 1066-1079 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. (English) Zbl 07774388

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 914-923 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bypassing the surface embedding: approximation schemes for network design in minor-free graphs. (English) Zbl 07774344

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 343-356 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

On comparison of power of partially hypoelliptic polynomials. (English. Russian original) Zbl 1509.35114

J. Contemp. Math. Anal., Armen. Acad. Sci. 57, No. 5, 289-295 (2022); translation from Izv. Nats. Akad. Nauk Armen., Mat. 57, No. 5, 33-43 (2022).
MSC:  35H10 12D10
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