×

Found 2,479 Documents (Results 1–100)

Kernelization for feedback vertex set via elimination distance to a forest. (English) Zbl 07682408

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 158-172 (2022).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Labelled sequent calculi for logics of strict implication. (English) Zbl 07668118

Fernández-Duque, David (ed.) et al., Advances in modal logic. Vol. 14. Proceedings of the 14th conference (AiML 2022), Rennes, France, August 22–25, 2022. London: College Publications. 625-641 (2022).
MSC:  03F03 03B45
PDF BibTeX XML Cite

Direct elimination of additive-cuts in GL4ip: verified and extracted. (English) Zbl 07668109

Fernández-Duque, David (ed.) et al., Advances in modal logic. Vol. 14. Proceedings of the 14th conference (AiML 2022), Rennes, France, August 22–25, 2022. London: College Publications. 429-449 (2022).
MSC:  03F45 03B35 03F05
PDF BibTeX XML Cite

Quantifier elimination versus Hilbert’s seventeenth problem. (Élimination des quantificateurs versus dix-septième problème de Hilbert.) (French) Zbl 1494.03006

Haffner, Emmylou (ed.) et al., L’épistémologie du dedans. Mélanges en l’honneur de Hourya Benis-Sinaceur. Paris: Classiques Garnier. Rencontres 479, 191-211 (2021).
PDF BibTeX XML Cite

A heuristic approach to the treedepth decomposition problem for large graphs. (English) Zbl 07538575

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 169-181 (2021).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI

FPT algorithms to compute the elimination distance to bipartite graphs and more. (English) Zbl 07538568

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 80-93 (2021).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Block elimination distance. (English) Zbl 07538565

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 28-38 (2021).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

A formally verified cut-elimination procedure for linear nested sequents for tense logic. (English) Zbl 07532522

Das, Anupam (ed.) et al., Automated reasoning with analytic tableaux and related methods. 30th international conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12842, 281-298 (2021).
MSC:  68V15
PDF BibTeX XML Cite
Full Text: DOI

The complexity of bicriteria tree-depth. (English) Zbl 07530227

Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 100-113 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

A proof of Bel’tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction. (English. Russian original) Zbl 1491.03012

Vestn. St. Petersbg. Univ., Math. 54, No. 4, 372-380 (2021); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 8(66), No. 4, 608-619 (2021).
PDF BibTeX XML Cite
Full Text: DOI

A proof of Bel’tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma. (English. Russian original) Zbl 1491.03011

Vestn. St. Petersbg. Univ., Math. 54, No. 3, 264-272 (2021); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 8(66), No. 3, 455-466 (2021).
PDF BibTeX XML Cite
Full Text: DOI

On the expressiveness of Büchi arithmetic. (English) Zbl 07410431

Kiefer, Stefan (ed.) et al., Foundations of software science and computation structures. 24th international conference, FOSSACS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12650, 310-323 (2021).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Database

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software