Výsledky vyhledávání - "Fixed-parameter algorithms AND complexity"

Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects

Autoři: Keung Ma Kin William I. Gasarch

Zdroj: The Computer Journal. 51:137-140

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/cj/cj51.html#GasarchK08
https://academic.oup.com/comjnl/article-abstract/51/1/137/504385

Parameterized Inapproximability Hypothesis under ETH.

Autoři: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi a další

Zdroj: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-40. 40p.

Témata: COMPUTATIONAL complexity, CONSTRAINT satisfaction, HADAMARD codes

Fixed-Parameter Algorithms and Complexity

Zdroj: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms ISBN: 9780429150234

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis

Autoři: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi a další

Témata: Applied Mathematics, Mathematical Sciences, Fixed-parameter algorithms and complexity, Hardness of approximations, PCP theorems

Přístupová URL adresa: https://escholarship.org/uc/item/1j64r6k1

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

Autoři: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Přispěvatelé: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Zdroj: Algorithmica. 85:2554-2579

Témata: Algebraic complexity, Fixed-parameter algorithms and complexity, Treewidth, Graph homomorphisms, Fine-grained complexity, Algebraic circuits, Homomorphism polynomials, Pathwidth, Monotone complexity, Treedepth, Algebraic branching programs, Algebraic formulas, ddc:004, Graph algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

Autoři: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Přispěvatelé: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Témata: Combinatorics and graph theory, Computational applications of logic, Data structures, Fixed-parameter algorithms and complexity, Graph algorithms

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2022.102
https://nbn-resolving.org/urn:nbn:de:0030-drops-164432
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

Autoři: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Přispěvatelé: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Témata: Homomorphism polynomials, Monotone complexity, Algebraic complexity, Graph algorithms, Fine-grained complexity, Fixed-parameter algorithms and complexity, Treewidth, Pathwidth, Treedepth, Graph homomorphisms, Algebraic circuits, Algebraic branching programs, Algebraic formulas

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2022.83
https://nbn-resolving.org/urn:nbn:de:0030-drops-164245
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

Autoři: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Přispěvatelé: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Data structures, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Fixed-parameter algorithms and complexity, Mathematics - Logic, 0102 computer and information sciences, Theory of computation → Finite Model Theory, 01 natural sciences, Logic in Computer Science (cs.LO), Theory of computation → Fixed parameter tractability, Computational applications of logic, Computer Science - Data Structures and Algorithms, Combinatorics and graph theory, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Logic (math.LO), Graph algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2111.03725
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102

Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects.

Autoři: William Gasarch Keung Ma Kin

Zdroj: Computer Journal. Jan2008, Vol. 51 Issue 1, p137-137. 1p.

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

Autoři: Pilipczuk, Micha? Schirrmacher, Nicole Siebertz, Sebastian a další

Témata: Combinatorics and graph theory, Computational applications of logic, Data structures, Fixed-parameter algorithms and complexity, Graph algorithms, Data processing Computer science, InProceedings, publishedVersion

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.

Autoři: Ganian, Robert Ordyniak, Sebastian

Zdroj: Algorithmica; Feb2021, Vol. 83 Issue 2, p726-752, 27p

Témata: UNDIRECTED graphs, POLYNOMIAL time algorithms, IMMERSIONS (Mathematics), ALGORITHMS

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem.

Autoři: Gutin, Gregory Kratsch, Stefan Wahlström, Magnus

Zdroj: Parameterized & Exact Computation 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers; 2014, p208-220, 13p

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Autoři: Takao Nishizeki Subramanian Arumugam Krishnaiyan Thulasiraman a další

Přístupová URL adresa: https://www.taylorfrancis.com/books/9781420011074
https://www.taylorfrancis.com/books/mono/10.1201/b19163/handbook-graph-theory-combinatorial-optimization-algorithms-krishnaiyan-kt-thulasiraman-subramanian-arumugam-andreas-brandst%C3%A4dt-takao-nishizeki

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Autoři: Krishnaiyan "KT" Thulasiraman Subramanian Arumugam Andreas Brandstädt a další

Resource Type: eBook.

Témata: Combinatorial optimization, Graph theory, Algorithms, Computer algorithms

Categories: COMPUTERS / Operating Systems / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / General, MATHEMATICS / Arithmetic, MATHEMATICS / Combinatorics

Parameterized and Exact Computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers

Autoři: Marek Cygan Pinar Heggernes

Resource Type: eBook.

Témata: Computer science, Algorithms, Computer science—Mathematics, Discrete mathematics

Categories: COMPUTERS / General, COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Discrete Mathematics

Algorithms and Data Structures : 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings

Autoři: Frank Dehne Jörg-Rüdiger Sack Csaba D. Toth

Resource Type: eBook.

Témata: Computer programming, Algorithms, Artificial intelligence—Data processing, Computer science—Mathematics, Discrete mathematics, Computer graphics, Numerical analysis

Categories: COMPUTERS / Programming / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Computer Science, COMPUTERS / Database Administration & Management, COMPUTERS / Programming / Algorithms, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis