×

Found 611 Documents (Results 1–100)

Thermal relaxation toward equilibrium and periodically pulsating spherical bubbles in an incompressible liquid. (English) Zbl 1533.76112

PDFBibTeX XMLCite
Full Text: DOI arXiv

On the consistency of circuit lower bounds for non-deterministic time. (English) Zbl 07844669

Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 1257-1270 (2023).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Turán’s theorem through algorithmic lens. (English) Zbl 07842223

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, 348-362 (2023).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

\( \mathcal{P} \)-matchings parameterized by treewidth. (English) Zbl 07842214

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, 217-231 (2023).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of finding tangles. (English) Zbl 1529.68183

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, 3-17 (2023).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Most classic problems remain NP-hard on relative neighborhood graphs and their relatives. (English) Zbl 07853701

Czumaj, Artur (ed.) et al., 18th Scandinavian symposium and workshops on algorithm theory, SWAT 2022, Tórshavn, Faroe Islands, June 27–29, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 227, Article 29, 19 p. (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tight lower bounds for approximate & exact \(k\)-center in \(\mathbb{R}^d\). (English) Zbl 07849026

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 28, 15 p. (2022).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Superlinear lower bounds based on ETH. (English) Zbl 07836622

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 55, 16 p. (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Satisfiability of circuits and equations over finite malcev algebras. (English) Zbl 07836604

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

Computing list homomorphisms in geometric intersection graphs. (English) Zbl 07682419

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, 313-327 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Parameterized complexity of list coloring and max coloring. (English) Zbl 07615730

Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 46-63 (2022).
MSC:  68Q27 68R10
PDFBibTeX XMLCite
Full Text: DOI

Winner determination algorithms for graph games with matching structures. (English) Zbl 07577722

Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 509-522 (2022).
MSC:  68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Refuting FPT algorithms for some parameterized problems under gap-ETH. (English) Zbl 07803580

Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 2, 12 p. (2021).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

An ETH-tight algorithm for multi-team formation. (English) Zbl 07799606

Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 28, 9 p. (2021).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Impatient PPSZ – a faster algorithm for CSP. (English) Zbl 07788606

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 33, 20 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH). (English) Zbl 07765279

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). 1684-1696 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient steady flow computations with exponential multigrid methods. (English) Zbl 1486.65171

Garanzha, Vladimir A. (ed.) et al., Numerical geometry, grid generation and scientific computing. Proceedings of the 10th international conference, NUMGRID 2020 / Delaunay 130, celebrating the 130th anniversary of Boris Delaunay, Moscow, Russia, November 25–27, 2020. Cham: Springer. Lect. Notes Comput. Sci. Eng. 143, 375-390 (2021).
PDFBibTeX XMLCite
Full Text: DOI

The double exponential runtime is tight for 2-stage stochastic ILPs. (English) Zbl 1482.90122

Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 297-310 (2021).
MSC:  90C10 90C05 90C60
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices. (English. Russian original) Zbl 1469.65087

Comput. Math. Math. Phys. 61, No. 5, 684-698 (2021); translation from Zh. Vychisl. Mat. Mat. Fiz. 61, No. 5, 706-722 (2021).
MSC:  65F60 15A16
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software