default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarolin Rehs
Person information
- affiliation: University of Düsseldorf, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Carolin Rehs
:
Comparing and Computing Parameters for Directed Graphs. University of Düsseldorf, Germany, 2022
Journal Articles
- 2023
- [j14]Frank Gurski, Carolin Rehs, Jochen Rethmann:
Characterizations and Directed Path-Width of Sequence Digraphs. Theory Comput. Syst. 67(2): 310-347 (2023) - [j13]Dominique Komander, Carolin Rehs:
Twin-distance-hereditary digraphs. Theor. Comput. Sci. 968: 114009 (2023) - 2022
- [j12]Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing directed Steiner path covers. J. Comb. Optim. 43(2): 402-431 (2022) - [j11]Frank Gurski, Dominique Komander, Carolin Rehs:
Correction to: Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 96(2): 313 (2022) - 2021
- [j10]Frank Gurski, Dominique Komander, Carolin Rehs:
On characterizations for subclasses of directed co-graphs. J. Comb. Optim. 41(1): 234-266 (2021) - [j9]Frank Gurski, Dominique Komander, Carolin Rehs:
How to compute digraph width measures on directed co-graphs. Theor. Comput. Sci. 855: 161-185 (2021) - 2020
- [j8]Frank Gurski, Carolin Rehs:
Counting and enumerating independent sets with applications to combinatorial optimization problems. Math. Methods Oper. Res. 91(3): 439-463 (2020) - [j7]Frank Gurski, Dominique Komander, Carolin Rehs:
Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 92(2): 401-433 (2020) - 2019
- [j6]Frank Gurski, Dominique Komander, Carolin Rehs:
Oriented Coloring on Recursively Defined Digraphs. Algorithms 12(4): 87 (2019) - [j5]Frank Gurski, Carolin Rehs:
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. Math. Methods Oper. Res. 89(3): 411-432 (2019) - [j4]Frank Gurski, Carolin Rehs:
Comparing Linear Width Parameters for Directed Graphs. Theory Comput. Syst. 63(6): 1358-1387 (2019) - [j3]Frank Gurski, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. OR Spectr. 41(2): 581-611 (2019) - [j2]Frank Gurski, Carolin Rehs, Jochen Rethmann:
Knapsack problems: A parameterized point of view. Theor. Comput. Sci. 775: 93-108 (2019) - [j1]Frank Gurski, Carolin Rehs, Jochen Rethmann:
On the hardness of palletizing bins using FIFO queues. Theor. Comput. Sci. 795: 100-107 (2019)
Conference and Workshop Papers
- 2023
- [c14]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. ESA 2023: 26:1-26:16 - 2021
- [c13]Frank Gurski, Dominique Komander, Carolin Rehs:
Acyclic Coloring Parameterized by Directed Clique-Width. CALDAM 2021: 95-108 - [c12]Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht:
Directed Width Parameters on Semicomplete Digraphs. COCOA 2021: 615-628 - 2020
- [c11]Nils Morawietz, Carolin Rehs, Mathias Weller:
A Timecop's Work Is Harder Than You Think. MFCS 2020: 71:1-71:14 - [c10]Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). SOFSEM 2020: 556-565 - 2019
- [c9]Frank Gurski, Dominique Komander, Carolin Rehs:
Characterizations for Special Directed Co-graphs. COCOA 2019: 252-264 - [c8]Frank Gurski, Dominique Komander, Carolin Rehs:
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). FCT 2019: 292-305 - [c7]Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. OR 2019: 331-338 - [c6]Frank Gurski, Dominique Komander, Carolin Rehs:
Subset Sum Problems with Special Digraph Constraints. OR 2019: 339-346 - [c5]Frank Gurski, Carolin Rehs:
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. SOFSEM 2019: 234-246 - 2018
- [c4]Frank Gurski, Carolin Rehs, Jochen Rethmann:
Directed Path-Width of Sequence Digraphs. COCOA 2018: 79-93 - [c3]Frank Gurski, Carolin Rehs:
Directed Path-Width and Directed Tree-Width of Directed Co-graphs. COCOON 2018: 255-267 - [c2]Frank Gurski, Carolin Rehs:
The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width. OR 2018: 259-265 - 2017
- [c1]Carolin Rehs, Frank Gurski:
A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. OR 2017: 295-301
Informal and Other Publications
- 2023
- [i12]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. CoRR abs/2306.17097 (2023) - 2021
- [i11]Dominique Komander, Carolin Rehs:
Twin-Distance-Hereditary Digraphs. CoRR abs/2112.04183 (2021) - 2020
- [i10]Frank Gurski, Dominique Komander, Carolin Rehs:
Solutions for Subset Sum Problems with Special Digraph Constraints. CoRR abs/2004.04712 (2020) - [i9]Frank Gurski, Dominique Komander, Carolin Rehs:
Acyclic coloring of special digraphs. CoRR abs/2006.13911 (2020) - [i8]Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing Directed Steiner Path Covers. CoRR abs/2012.12232 (2020) - 2019
- [i7]Frank Gurski, Dominique Komander, Carolin Rehs:
Oriented coloring on recursively defined digraphs. CoRR abs/1904.01570 (2019) - [i6]Frank Gurski, Dominique Komander, Carolin Rehs:
On Characterizations for Subclasses of Directed Co-Graphs. CoRR abs/1907.00801 (2019) - 2018
- [i5]Frank Gurski, Carolin Rehs:
Computing directed path-width and directed tree-width of recursively defined digraphs. CoRR abs/1806.04457 (2018) - [i4]Frank Gurski, Carolin Rehs, Jochen Rethmann:
Characterizations and Directed Path-Width of Sequence Digraphs. CoRR abs/1811.02259 (2018) - [i3]Frank Gurski, Carolin Rehs:
Comparing Linear Width Parameters for Directed Graphs. CoRR abs/1812.06653 (2018) - 2017
- [i2]Frank Gurski, Carolin Rehs:
Counting and Enumerating Independent Sets with Applications to Knapsack Problems. CoRR abs/1710.08953 (2017) - 2016
- [i1]Carolin Albrecht, Frank Gurski, Jochen Rethmann, Eda Yilmaz:
Knapsack Problems: A Parameterized Point of View. CoRR abs/1611.07724 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
