2 citations · 2 across the 3 of their papers we have counts for
4 papers
Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs
Karolina Drabik, Anita Dürr, Fabian Frei +2
In the field of computational logic, two classes of finite automata are considered fundamental: deterministic and nondeterministic automata (DFAs and NFAs). In a more fine-grained…
Space-Efficient Algorithm for Integer Programming with Few Constraints
Lars Rohwedder, Karol Węgrzycki
Integer linear programs , where , , and , can be solved…
Fine-Grained Equivalence for Problems Related to Integer Linear Programming
Lars Rohwedder, Karol Węgrzycki
Integer Linear Programming with binary variables and many -constraints can be solved in time and it is open whether the dependence o…
Knapsack and Subset Sum with Small Items
Adam Polak, Lars Rohwedder, Karol Węgrzycki
Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomi…