Výsledky vyhledávání - Parameterized Algorithms ACM Reference Format

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs.

Autoři: Feldmann, Andreas Emil Lampis, Michael

Zdroj: ACM Transactions on Algorithms; Oct2025, Vol. 21 Issue 4, p1-26, 26p

Témata: ALGORITHMS, COST

Kernel(s) for Problems With No Kernel: On Out-Trees With Many Leaves

Autoři: Daniel Binkele-raible Henning Fernau FEDOR V. FOMIN a další

Přispěvatelé: Daniel Binkele-raible Henning Fernau FEDOR V. FOMIN a další

Zdroj: http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory Additional Key Words and Phrases, Kernelization, Lower Bounds, Max-Leaf Spanning Tree, Out-Branching, Parameterized Algorithms ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7957; http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7957
http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf

Parameterized complexity of DPLL search procedures

Autoři: Olaf Beyersdorff, Nicola Galesi, Massimo Lauria The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Olaf Beyersdorff, Nicola Galesi, Massimo Lauria The Pennsylvania State University CiteSeerX Archives

Zdroj: http://tocl.acm.org/accepted/beyersdorff-galesi_parameterized.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Algorithms, Theory Additional Key Words and Phrases, Proof complexity, parameterized complexity, Resolution, Prover-Delayer games ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3540

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3540
http://tocl.acm.org/accepted/beyersdorff-galesi_parameterized.pdf

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms.

Autoři: SAU, IGNASI STAMOULIS, GIANNOS THILIKOS, DIMITRIOS M.

Zdroj: ACM Transactions on Algorithms; Oct2022, Vol. 18 Issue 3, p1-30, 30p

Témata: ALGORITHMS, CHARTS, diagrams, etc., MINORS, POLYNOMIALS

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity.

Autoři: Panolan, Fahad Saurabh, Saket Zehavi, Meirav

Zdroj: ACM Transactions on Algorithms; Apr2024, Vol. 20 Issue 2, p1-50, 50p

Témata: GRAPH theory, POLYNOMIAL time algorithms, ARBORETUMS, CUTTING stock problem, MATROIDS, PLANAR graphs, OPEN-ended questions, STEINER systems

Parameterized bounded-depth Frege is not optimal

Autoři: Olaf Beyersdorff Nicola Galesi Massimo Lauria a další

Přispěvatelé: Olaf Beyersdorff Nicola Galesi Massimo Lauria a další

Zdroj: http://people.cs.uchicago.edu/~razborov/files/parres.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Algorithms, Theory Additional Key Words and Phrases, Proof complexity, parameterized complexity, Resolution, bounded-depth Frege ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4930; http://people.cs.uchicago.edu/~razborov/files/parres.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4930
http://people.cs.uchicago.edu/~razborov/files/parres.pdf

Exact Algorithms via Monotone Local Search.

Autoři: FOMIN, FEDOR V. GASPERS, SERGE LOKSHTANOV, DANIEL a další

Zdroj: Journal of the ACM; Apr2019, Vol. 66 Issue 2, p1-23, 23p

Témata: ALGORITHMS, SUBSET selection, INTEGERS

Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams.

Autoři: MARX, DÁNIEL PILIPCZUK, MICHAŁ

Zdroj: ACM Transactions on Algorithms; Apr2022, Vol. 18 Issue 2, p1-64, 64p

Témata: VORONOI polygons, GRAPH algorithms, ALGORITHMS, PLANAR graphs

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.

Autoři: FOMIN, FEDOR V. LOKSHTANOV, DANIEL PANOLAN, FAHAD a další

Zdroj: Journal of the ACM; Sep2016, Vol. 63 Issue 4, p29-29:60, 60p

Témata: MATHEMATICAL models, FAMILIES, MATROIDS, PARAMETER estimation, MATHEMATICAL programming, FOUNDATIONS of arithmetic

On the trade-off between power and flexibility of FPGA clock networks

Autoři: Julien Lamoureux Steven J. E. Wilton The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Julien Lamoureux Steven J. E. Wilton The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.ece.ubc.ca/~julienl/papers/pdf/trets08.pdf.

Témata: Categories and Subject Descriptors, B.7.1 [Integrated Circuits, Types and Design Styles—Gate arrays, B.7.2 [Integrated Circuits, Design Aids—Placement and routing General Terms, Algorithms, Design, Experimentation Additional Key Words and Phrases, FPGA, clock distribution networks, clock-aware placement, low-power design ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.628.3331; http://www.ece.ubc.ca/~julienl/papers/pdf/trets08.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.628.3331
http://www.ece.ubc.ca/~julienl/papers/pdf/trets08.pdf

A complexity dichotomy for finding disjoint solutions of vertex deletion problems

Autoři: Michael R. Fellows Jiong Guo Hannes Moser a další

Přispěvatelé: Michael R. Fellows Jiong Guo Hannes Moser a další

Zdroj: http://www.akt.tu-berlin.de/fileadmin/fg34/publications-akt/a-complexity-dichotomy-for-finding-disjoint-solutions-of-vertex-deletion-problems.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Iterative compression, computational complexity, parameterized complexity, graph algorithms, hereditary graph properties, vertex deletion problems ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.8703

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.8703
http://www.akt.tu-berlin.de/fileadmin/fg34/publications-akt/a-complexity-dichotomy-for-finding-disjoint-solutions-of-vertex-deletion-problems.pdf

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

Autoři: LOKSHTANOV, DANIEL PANOLAN, FAHAD SAURABH, SAKET a další

Zdroj: ACM Transactions on Algorithms; May2020, Vol. 16 Issue 3, p1-31, 31p

Témata: INDEPENDENT sets, DETERMINISTIC algorithms, MACHINE separators, ALGORITHMS, POLYNOMIAL time algorithms, OVERHEAD costs

Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs.

Autoři: Fomin, Fedor V. Golovach, Petr A.

Zdroj: Algorithmica; Jul2021, Vol. 83 Issue 7, p2170-2214, 45p

Témata: ALGORITHMS, INDEPENDENT sets, GRAPH algorithms, GRAPH coloring, PLANAR graphs

Algebraic Fingerprints for Faster Algorithms.

Autoři: KOUTIS, IOANNIS WILLIAMS, RYAN

Zdroj: Communications of the ACM; Jan2016, Vol. 59 Issue 1, p98-105, 8p, 1 Black and White Photograph, 3 Diagrams

Témata: ALGORITHMS, PARAMETERIZATION, ALGEBRA, NP-complete problems

People: BJORKLUND, Andreas

Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts.

Autoři: RAMANUJAN, M. S. SAURABH, SAKET

Zdroj: ACM Transactions on Algorithms; Sep2017, Vol. 13 Issue 4, p46:1-46:25, 25p

Témata: ALGORITHMS, GEOMETRIC vertices, FLOWS (Differentiable dynamical systems), DATA analysis, GRAPH theory

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes.

Autoři: Fomin, Fedorr V. Lokshtanov, Daniel Saurabh, Saket

Zdroj: Journal of the ACM; Jan2018, Vol. 65 Issue 2, p1-44, 44p

Témata: POLYNOMIAL time algorithms, APPROXIMATION theory, PLANAR graphs, GRAPH theory, MATHEMATICS theorems

Exact Exponential Algorithms.

Autoři: FOMIN, FEDOR V. KASKI, PETTERI

Zdroj: Communications of the ACM; Mar2013, Vol. 56 Issue 3, p80-88, 9p, 1 Color Photograph, 7 Diagrams

Témata: EXPONENTIAL functions, ALGORITHM research, PROBLEM solving, PARAMETER estimation, APPROXIMATION algorithms, COMPUTER science research

Treewidth-based algorithms for the small parsimony problem on networks.

Autoři: Scornavacca, Celine Weller, Mathias

Zdroj: Algorithms for Molecular Biology; 8/20/2022, Vol. 17 Issue 1, p1-31, 31p

Témata: PARSIMONIOUS models, ALGORITHMS, DYNAMIC programming, UNDIRECTED graphs, PLANT hybridization, EVOLUTIONARY computation, ASSIGNMENT problems (Programming), GRAPH algorithms

Read-once refutations in Horn constraint systems: an algorithmic approach.

Autoři: Subramani, K Wojciechowski, Piotr Sheng, Ying

Zdroj: Journal of Logic & Computation; Jun2022, Vol. 32 Issue 4, p667-696, 30p

Témata: NUMBER systems, LINEAR systems, ALGORITHMS, TIME management, APPROXIMATION algorithms

NANUQ⁺: A divide-and-conquer approach to network estimation.

Autoři: Allman, Elizabeth S. Baños, Hector Rhodes, John A. a další

Zdroj: Algorithms for Molecular Biology; 7/25/2025, Vol. 20 Issue 1, p1-25, 25p

Témata: PARALLEL algorithms