Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCornelius Brand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Cornelius Brand, Robert Ganian, Kirill Simonov:
A Parameterized Theory of PAC Learning. AAAI 2023: 6834-6841- [c10]Cornelius Brand, Martin Koutecký, Alexandra Lassota:
A Polyhedral Perspective on Tropical Convolutions. IWOCA 2023: 111-122 - [c9]Cornelius Brand, Viktoriia Korchemna, Michael Skotnica:
Deterministic Constrained Multilinear Detection. MFCS 2023: 25:1-25:14 - [i12]Cornelius Brand, Robert Ganian, Kirill Simonov:
A Parameterized Theory of PAC Learning. CoRR abs/2304.14058 (2023) - [i11]Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager:
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. CoRR abs/2308.10600 (2023) - [i10]Cornelius Brand, Viktoriia Korchemna, Michael Skotnica, Kirill Simonov:
Counting Vanishing Matrix-Vector Products. CoRR abs/2309.13698 (2023) - 2022
- [j4]Cornelius Brand
:
A note on algebraic techniques for subgraph detection. Inf. Process. Lett. 176: 106242 (2022) - [j3]Cornelius Brand:
Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms. J. Comput. Syst. Sci. 129: 62-71 (2022) - [c8]Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna:
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. WG 2022: 98-113 - [i9]Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna:
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. CoRR abs/2202.13661 (2022) - 2021
- [j2]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. 49(3): 310-315 (2021) - [c7]Cornelius Brand, Martin Koutecký, Sebastian Ordyniak:
Parameterized Algorithms for MILPs with Small Treedepth. AAAI 2021: 12249-12257 - [c6]Cornelius Brand, Kevin Pratt:
Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials. ICALP 2021: 38:1-38:19 - [i8]Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak:
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR abs/2111.08048 (2021) - 2020
- [i7]Cornelius Brand, Kevin Pratt:
An Algorithmic Method of Partial Derivatives. CoRR abs/2005.05143 (2020) - [i6]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR abs/2010.10809 (2020)
2010 – 2019
- 2019
- [b1]Cornelius Brand:
Paths and walks, forests and planes. Saarland University, Germany, 2019 - [j1]Cornelius Brand, Holger Dell, Marc Roth:
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. Algorithmica 81(2): 541-556 (2019) - [c5]Cornelius Brand:
Patching Colors with Tensors. ESA 2019: 25:1-25:16 - [i5]Cornelius Brand, Martin Koutecký, Sebastian Ordyniak:
Parameterized Algorithms for MILPs with Small Treedepth. CoRR abs/1912.03501 (2019) - 2018
- [c4]Cornelius Brand, Holger Dell, Thore Husfeldt:
Extensor-coding. STOC 2018: 151-164 - [i4]Cornelius Brand, Holger Dell, Thore Husfeldt:
Extensor-Coding. CoRR abs/1804.09448 (2018) - 2017
- [c3]Cornelius Brand, Marc Roth:
Parameterized Counting of Trees, Forests and Matroid Bases. CSR 2017: 85-98 - 2016
- [c2]Cornelius Brand, Michael Sagraloff:
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. ISSAC 2016: 151-158 - [c1]Cornelius Brand, Holger Dell, Marc Roth:
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. IPEC 2016: 9:1-9:14 - [i3]Cornelius Brand, Michael Sagraloff:
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. CoRR abs/1604.08944 (2016) - [i2]Cornelius Brand, Holger Dell, Marc Roth:
Fine-grained dichotomies for the Tutte plane and Boolean #CSP. CoRR abs/1606.06581 (2016) - [i1]Cornelius Brand, Marc Roth:
Parameterized counting of trees, forests and matroid bases. CoRR abs/1611.01823 (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 2023-09-29 22:15 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:
