default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelix Reidl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. SWAT 2024: 8:1-8:17- [i33]Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. CoRR abs/2402.10335 (2024) - [i32]Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan:
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. CoRR abs/2407.00251 (2024) - [i31]Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani
, Felix Reidl, Blair D. Sullivan:
Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help? CoRR abs/2409.08219 (2024) - 2023
- [j13]Felix Reidl, Blair D. Sullivan:
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. Algorithmica 85(8): 2318-2347 (2023) - [c22]Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing Complexity Measures of Degenerate Graphs. IPEC 2023: 14:1-14:21 - [i30]Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing complexity measures of degenerate graphs. CoRR abs/2308.08868 (2023) - 2022
- [c21]Oded Lachish, Felix Reidl, Chhaya Trehan:
When You Come at the King You Best Not Miss. FSTTCS 2022: 25:1-25:12 - [c20]Pål Grønås Drange, Irene Muzi, Felix Reidl:
Harmless Sets in Sparse Classes. IWOCA 2022: 299-312 - [i29]Oded Lachish, Felix Reidl, Chhaya Trehan:
When you come at the kings you best not miss. CoRR abs/2209.12082 (2022) - 2021
- [i28]Pål Grønås Drange, Irene Muzi, Felix Reidl:
Kernelization and hardness of harmless sets in sparse classes. CoRR abs/2111.11834 (2021) - 2020
- [j12]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. 806: 133-143 (2020) - [c19]Carl Einarson, Felix Reidl:
A General Kernelization Technique for Domination and Independence Problems in Sparse Classes. IPEC 2020: 11:1-11:15 - [i27]Felix Reidl, Blair D. Sullivan:
A color-avoiding approach to subgraph counting in bounded expansion classes. CoRR abs/2001.05236 (2020) - [i26]Carl Einarson, Felix Reidl:
A general kernelization technique for domination and independence problems in sparse classes. CoRR abs/2002.09028 (2020)
2010 – 2019
- 2019
- [j11]Felix Reidl, Fernando Sánchez Villaamil, Konstantinos S. Stavropoulos:
Characterising bounded expansion by neighbourhood complexity. Eur. J. Comb. 75: 152-168 (2019) - [j10]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. 101: 1-20 (2019) - [j9]Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan:
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. 105: 199-241 (2019) - [j8]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24(1): 2.6:1-2.6:34 (2019) - [c18]Carl Einarson, Felix Reidl:
Domination Above r-Independence: Does Sparseness Help? MFCS 2019: 40:1-40:13 - [i25]Nikola K. Blanchard, Eldar Fischer, Oded Lachish, Felix Reidl:
Longest paths in 2-edge-connected cubic graphs. CoRR abs/1903.02508 (2019) - [i24]Carl Einarson, Felix Reidl:
Domination above r-independence: does sparseness help? CoRR abs/1906.09180 (2019) - 2018
- [j7]Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. Algorithms 11(7): 98 (2018) - [j6]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. 95: 69-85 (2018) - [j5]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
k-distinct in- and out-branchings in digraphs. J. Comput. Syst. Sci. 95: 86-97 (2018) - [c17]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. ALENEX 2018: 75-86 - [c16]Felix Reidl, Magnus Wahlström:
Parameterized Algorithms for Zero Extension and Metric Labelling Problems. ICALP 2018: 94:1-94:14 - [c15]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA 2018: 14:1-14:16 - [i23]Gregory Z. Gutin, George B. Mertzios, Felix Reidl:
Searching for Maximum Out-Degree Vertices in Tournaments. CoRR abs/1801.04702 (2018) - [i22]Felix Reidl, Magnus Wahlström:
Parameterized Algorithms for Zero Extension and Metric Labelling Problems. CoRR abs/1802.06026 (2018) - [i21]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR abs/1802.09801 (2018) - [i20]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. CoRR abs/1804.10670 (2018) - [i19]Gregory Z. Gutin, George B. Mertzios, Felix Reidl:
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. CoRR abs/1805.01684 (2018) - 2017
- [j4]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84: 219-242 (2017) - [c14]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-Contractions, Edge Deletions and Connectivity Preservation. ESA 2017: 47:1-47:13 - [c13]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
k-Distinct In- and Out-Branchings in Digraphs. ICALP 2017: 58:1-58:13 - [c12]Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan:
Being Even Slightly Shallow Makes Life Hard. MFCS 2017: 79:1-79:13 - [i18]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. CoRR abs/1704.06622 (2017) - [i17]Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan:
Being even slightly shallow makes life hard. CoRR abs/1705.06796 (2017) - [i16]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR abs/1706.03698 (2017) - [i15]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. CoRR abs/1706.07851 (2017) - 2016
- [b1]Felix Reidl:
Structural sparseness and complex networks. RWTH Aachen University, Germany, 2016 - [j3]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar:
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms 12(2): 21:1-21:41 (2016) - [c11]Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel:
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. ICDM 2016: 829-834 - [c10]Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [i14]Felix Reidl, Fernando Sánchez Villaamil, Konstantinos S. Stavropoulos:
Characterising Bounded Expansion by Neighbourhood Complexity. CoRR abs/1603.09532 (2016) - [i13]Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, depth and space. CoRR abs/1607.00945 (2016) - [i12]Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel:
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. CoRR abs/1609.05081 (2016) - [i11]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
$k$-Distinct In- and Out-Branchings in Digraphs. CoRR abs/1612.03607 (2016) - 2015
- [j2]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Zig-Zag Numberlink is NP-Complete. J. Inf. Process. 23(3): 239-245 (2015) - [c9]Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. IPEC 2015: 402-413 - [c8]Matthew Farrell, Timothy D. Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. WAW 2015: 29-41 - [i10]Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. CoRR abs/1507.08158 (2015) - 2014
- [j1]Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Practical algorithms for MSO model-checking on tree-decomposable graphs. Comput. Sci. Rev. 13-14: 39-74 (2014) - [c7]Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
A Faster Parameterized Algorithm for Treedepth. ICALP (1) 2014: 931-942 - [c6]Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Finite Integer Index of Pathwidth and Treewidth. IPEC 2014: 258-269 - [i9]Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
A Faster Parameterized Algorithm for Treedepth. CoRR abs/1401.7540 (2014) - [i8]Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan:
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. CoRR abs/1406.2587 (2014) - [i7]Matthew Farrell, Timothy Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Hyperbolicity, degeneracy, and expansion of random intersection graphs. CoRR abs/1409.8196 (2014) - [i6]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Zig-Zag Numberlink is NP-Complete. CoRR abs/1410.5845 (2014) - [i5]Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization and Sparseness: the case of Dominating Set. CoRR abs/1411.4575 (2014) - [i4]Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Overlapping Communities in Social Networks. CoRR abs/1412.4973 (2014) - 2013
- [c5]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. ESA 2013: 529-540 - [c4]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar:
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) 2013: 613-624 - [i3]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. CoRR abs/1302.6863 (2013) - 2012
- [c3]Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Evaluation of an MSO-Solver. ALENEX 2012: 55-63 - [i2]Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Linear Kernels on Graphs Excluding Topological Minors. CoRR abs/1201.2780 (2012) - [i1]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar:
Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR abs/1207.0835 (2012) - 2011
- [c2]Philipp Kranen, Felix Reidl, Fernando Sánchez Villaamil, Thomas Seidl:
Hierarchical Clustering for Real-Time Stream Data with Noise. SSDBM 2011: 405-413 - 2010
- [c1]Emmanuel Müller, Philipp Kranen, Michael Nett, Felix Reidl, Thomas Seidl:
Air-Indexing on Error Prone Communication Channels. DASFAA (1) 2010: 505-519
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-16 20:34 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:
