542 results on '"Dániel Marx"'
Search Results
2. Hitting Meets Packing: How Hard Can It Be?
3. Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.
4. Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification.
5. Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces.
6. Counting Small Induced Subgraphs with Edge-Monotone Properties.
7. Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern.
8. Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof.
9. Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.
10. Computing Generalized Convolutions Faster Than Brute Force.
11. Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
12. From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs.
13. Parameterized Approximation Schemes for Clustering with General Norm Objectives.
14. Approximate Monotone Local Search for Weighted Problems.
15. Computing Square Colorings on Bounded-Treewidth and Planar Graphs.
16. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
17. Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds.
18. Computing Generalized Convolutions Faster Than Brute Force.
19. Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard).
20. Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
21. Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
22. Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves.
23. Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.
24. A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
25. Parameterized Complexity of Weighted Multicut in Trees.
26. Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams.
27. Incompressibility of H-free edge modification problems: Towards a dichotomy.
28. The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201).
29. A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs.
30. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.
31. Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof.
32. Counting Small Induced Subgraphs with Edge-monotone Properties.
33. Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.
34. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.
35. Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern.
36. Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces.
37. Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth.
38. Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction.
39. On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting.
40. Hitting Long Directed Cycles Is Fixed-Parameter Tractable.
41. Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction.
42. Chordless Cycle Packing Is Fixed-Parameter Tractable.
43. Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy.
44. Four Shorts Stories on Surprising Algorithmic Uses of Treewidth.
45. Finding and Counting Permutations via CSPs.
46. Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
47. Parameterized Intractability of Even Set and Shortest Vector Problem.
48. Parameterized Streaming Algorithms for Min-Ones d-SAT.
49. Finding and Counting Permutations via CSPs.
50. Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.