E-LIB Suche - Ergebnisse für: Niedermeier, Rolf

1

New parameterized algorithms for matching and packing probl..:

Koana, Tomohiro , 2024

2

Fast Parameterized Preprocessing for Polynomial-Time Solvab..:

Himmel, Anne-Sophie ; Mertzios, George B. ; Nichterlein, André.
Communications of the ACM. 67 (2024) 4 - p. 70-79 , 2024

Link: https://doi.org/10.1145/..

3

Approximating sparse quadratic programs:

Hermelin, Danny ; Kellerhals, Leon ; Niedermeier, Rolf.
Theoretical Computer Science. 984 (2024) - p. 114319 , 2024

Link: https://doi.org/10.1016/..

4

Modification-fair cluster editing:

Froese, Vincent ; Kellerhals, Leon ; Niedermeier, Rolf
Social Network Analysis and Mining. 14 (2024) 1 - p. , 2024

Link: https://doi.org/10.1007/..

5

Equilibria in schelling games: computational hardness and r..:

Kreisel, Luca ; Boehmer, Niclas ; Froese, Vincent.
Autonomous Agents and Multi-Agent Systems. 38 (2024) 1 - p. , 2024

Link: https://doi.org/10.1007/..

6

Algorithmic aspects of temporal betweenness:

Buß, Sebastian ; Molter, Hendrik ; Niedermeier, Rolf.
Network Science. 12 (2024) 2 - p. 160-188 , 2024

Link: https://doi.org/10.1017/..

7

Algorithmic and structural aspects of temporal graphs:

Renken, Malte , 2023

Link: https://nbn-resolving.de..

8

Application-oriented collective decision making: experiment..

Foundations of Computing ; 18

Böhmer, Niclas , 2023

Link: https://nbn-resolving.de..

9

Stable matchings beyond stable marriage: models, algorithms..:

Heeger, Klaus , 2023

Link: https://nbn-resolving.de..

10

Towards Classifying the Polynomial-Time Solvability of Temp..:

Rymar, Maciej ; Molter, Hendrik ; Nichterlein, André.
Journal of Graph Algorithms and Applications. 27 (2023) 3 - p. 173-194 , 2023

Link: https://doi.org/10.7155/..

11

Polynomial-time data reduction for weighted problems beyond..:

Bentert, Matthias ; van Bevern, René ; Fluschnik, Till..
Discrete Applied Mathematics. 328 (2023) - p. 117-133 , 2023

Link: https://doi.org/10.1016/..

12

Temporal interval cliques and independent sets:

Hermelin, Danny ; Itzhaki, Yuval ; Molter, Hendrik.
Theoretical Computer Science. 961 (2023) - p. 113885 , 2023

Link: https://doi.org/10.1016/..

13

The complexity of gerrymandering over graphs: Paths and tre..:

Bentert, Matthias ; Koana, Tomohiro ; Niedermeier, Rolf
Discrete Applied Mathematics. 324 (2023) - p. 103-112 , 2023

Link: https://doi.org/10.1016/..

14

The complexity of binary matrix completion under diameter c..:

Koana, Tomohiro ; Froese, Vincent ; Niedermeier, Rolf
Journal of Computer and System Sciences. 132 (2023) - p. 45-67 , 2023

Link: https://doi.org/10.1016/..

15

A multivariate complexity analysis of the material consumpt..:

Bentert, Matthias ; Bredereck, Robert ; Györgyi, Péter..
Journal of Scheduling. 26 (2023) 4 - p. 369-382 , 2023

Link: https://doi.org/10.1007/..