Carolin Rehs - RankMe

52 papers A* 3A 1B 4C 3Misc 1Journal 32Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation. SODA Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin, André Nusser, Carolin Rehs
2026	J	`jnl`	Compatible Triangulations of Simple Polygons. CoRR Peyman Afshani, Boris Aronov, Kevin Buchin, Maike Buchin, Otfried Cheong, Katharina Klost, Carolin Rehs, Günter Rote
2026	J	`jnl`	On Small Pair Decompositions for Point Sets. CoRR Kevin Buchin, Jacobus Conradi, Sariel Har-Peled, Antonia Kalb, Abhiruk Lahiri, Lukas Plätz, Carolin Rehs
2026	J	`jnl`	Oriented Spanners. Algorithmica Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
2025	J	`jnl`	Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation. CoRR Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin, André Nusser, Carolin Rehs
2025	A*	`conf`	Computing Oriented Spanners and Their Dilation. SoCG Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, Sampson Wong
2025	A*	`conf`	Geometric Spanners of Bounded Tree-Width. SoCG Kevin Buchin, Carolin Rehs, Torben Scheele
2025	—	`conf`	Orienteering (with Time Windows) on Restricted Graph Classes. SOFSEM (1) Kevin Buchin, Mart Hagedoorn, Guangping Li, Carolin Rehs
2024	J	`jnl`	Computing Oriented Spanners and their Dilation. CoRR Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Michiel Smid, Carolin Rehs, Sampson Wong
2024	—	`conf`	Experimental analysis of oriented spanners on one-dimensional point sets. CCCG Antonia Kalb, Kevin Buchin, Carolin Rehs, Guangping Li
2024	J	`jnl`	Geometric spanners of bounded tree-width. CoRR Kevin Buchin, Carolin Rehs, Torben Scheele
2024	J	`jnl`	Orienteering (with Time Windows) on Restricted Graph Classes. CoRR Kevin Buchin, Mart Hagedoorn, Guangping Li, Carolin Rehs
2023	J	`jnl`	Characterizations and Directed Path-Width of Sequence Digraphs. Theory Comput. Syst. Frank Gurski, Carolin Rehs, Jochen Rethmann
2023	A	`conf`	Oriented Spanners. ESA Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
2023	J	`jnl`	Oriented Spanners. CoRR Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
2023	J	`jnl`	Twin-distance-hereditary digraphs. Theor. Comput. Sci. Dominique Komander, Carolin Rehs
2022	—	`—`	Comparing and Computing Parameters for Directed Graphs. Carolin Rehs
2022	J	`jnl`	Computing directed Steiner path covers. J. Comb. Optim. Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2022	J	`jnl`	Correction to: Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. Frank Gurski, Dominique Komander, Carolin Rehs
2021	—	`conf`	Acyclic Coloring Parameterized by Directed Clique-Width. CALDAM Frank Gurski, Dominique Komander, Carolin Rehs
2021	C	`conf`	Directed Width Parameters on Semicomplete Digraphs. COCOA Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht
2021	J	`jnl`	How to compute digraph width measures on directed co-graphs. Theor. Comput. Sci. Frank Gurski, Dominique Komander, Carolin Rehs
2021	J	`jnl`	On characterizations for subclasses of directed co-graphs. J. Comb. Optim. Frank Gurski, Dominique Komander, Carolin Rehs
2021	J	`jnl`	Twin-Distance-Hereditary Digraphs. CoRR Dominique Komander, Carolin Rehs
2020	B	`conf`	A Timecop's Work Is Harder Than You Think. MFCS Nils Morawietz, Carolin Rehs, Mathias Weller
2020	J	`jnl`	Acyclic coloring of special digraphs. CoRR Frank Gurski, Dominique Komander, Carolin Rehs
2020	B	`conf`	Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). SOFSEM Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2020	J	`jnl`	Computing Directed Steiner Path Covers. CoRR Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2020	J	`jnl`	Counting and enumerating independent sets with applications to combinatorial optimization problems. Math. Methods Oper. Res. Frank Gurski, Carolin Rehs
2020	J	`jnl`	Solutions for Subset Sum Problems with Special Digraph Constraints. CoRR Frank Gurski, Dominique Komander, Carolin Rehs
2020	J	`jnl`	Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. Frank Gurski, Dominique Komander, Carolin Rehs
2019	C	`conf`	Characterizations for Special Directed Co-graphs. COCOA Frank Gurski, Dominique Komander, Carolin Rehs
2019	J	`jnl`	Comparing Linear Width Parameters for Directed Graphs. Theory Comput. Syst. Frank Gurski, Carolin Rehs
2019	B	`conf`	Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). FCT Frank Gurski, Dominique Komander, Carolin Rehs
2019	J	`jnl`	Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. OR Spectr. Frank Gurski, Carolin Rehs, Jochen Rethmann, Egon Wanke
2019	—	`conf`	Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. OR Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
2019	B	`conf`	Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. SOFSEM Frank Gurski, Carolin Rehs
2019	J	`jnl`	Knapsack problems: A parameterized point of view. Theor. Comput. Sci. Frank Gurski, Carolin Rehs, Jochen Rethmann
2019	J	`jnl`	On Characterizations for Subclasses of Directed Co-Graphs. CoRR Frank Gurski, Dominique Komander, Carolin Rehs
2019	J	`jnl`	On the hardness of palletizing bins using FIFO queues. Theor. Comput. Sci. Frank Gurski, Carolin Rehs, Jochen Rethmann
2019	J	`jnl`	Oriented Coloring on Recursively Defined Digraphs. Algorithms Frank Gurski, Dominique Komander, Carolin Rehs
2019	J	`jnl`	Oriented coloring on recursively defined digraphs. CoRR Frank Gurski, Dominique Komander, Carolin Rehs
2019	J	`jnl`	Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. Math. Methods Oper. Res. Frank Gurski, Carolin Rehs
2019	—	`conf`	Subset Sum Problems with Special Digraph Constraints. OR Frank Gurski, Dominique Komander, Carolin Rehs
2018	J	`jnl`	Characterizations and Directed Path-Width of Sequence Digraphs. CoRR Frank Gurski, Carolin Rehs, Jochen Rethmann
2018	J	`jnl`	Comparing Linear Width Parameters for Directed Graphs. CoRR Frank Gurski, Carolin Rehs
2018	J	`jnl`	Computing directed path-width and directed tree-width of recursively defined digraphs. CoRR Frank Gurski, Carolin Rehs
2018	Misc	`conf`	Directed Path-Width and Directed Tree-Width of Directed Co-graphs. COCOON Frank Gurski, Carolin Rehs
2018	C	`conf`	Directed Path-Width of Sequence Digraphs. COCOA Frank Gurski, Carolin Rehs, Jochen Rethmann
2018	—	`conf`	The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width. OR Frank Gurski, Carolin Rehs
2017	—	`conf`	A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. OR Carolin Rehs, Frank Gurski
2017	J	`jnl`	Counting and Enumerating Independent Sets with Applications to Knapsack Problems. CoRR Frank Gurski, Carolin Rehs