default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew van der Poel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c7]Brian Lavallee, Hayley Russell, Blair D. Sullivan
, Andrew van der Poel:
Approximating Vertex Cover using Structural Rounding. ALENEX 2020: 70-80
2010 – 2019
- 2019
- [c6]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA 2019: 37:1-37:15 - [c5]Kyle Kloster, Blair D. Sullivan, Andrew van der Poel:
Mining Maximal Induced Bicliques using Odd Cycle Transversals. SDM 2019: 324-332 - [c4]Blair D. Sullivan, Andrew van der Poel, Trey Woodlief:
Faster Biclique Mining in Near-Bipartite Graphs. SEA² 2019: 424-453 - [i7]Blair D. Sullivan, Andrew van der Poel, Trey Woodlief:
Faster Biclique Mining in Near-Bipartite Graphs. CoRR abs/1903.01538 (2019) - [i6]Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel:
Approximating Vertex Cover using Structural Rounding. CoRR abs/1909.04611 (2019) - 2018
- [c3]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 - [i5]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. CoRR abs/1806.02771 (2018) - [i4]Kyle Kloster, Blair D. Sullivan, Andrew van der Poel:
Mining Maximal Induced Bicliques using Odd Cycle Transversals. CoRR abs/1810.11421 (2018) - 2017
- [i3]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
- [c2]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 - [c1]Blair D. Sullivan, Andrew van der Poel:
A Fast Parameterized Algorithm for Co-Path Set. IPEC 2016: 28:1-28:13 - [i2]Blair D. Sullivan, Andrew van der Poel:
A Fast Parameterized Algorithm for Co-Path Set. CoRR abs/1603.04376 (2016) - [i1]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)
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 21:19 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:
