Andrew van der Poel

According to our database, Andrew van der Poel authored at least 7 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Approximating Vertex Cover using Structural Rounding.

Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Faster Biclique Mining in Near-Bipartite Graphs.

Blair D. Sullivan, Andrew van der Poel, Trey Woodlief

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Mining Maximal Induced Bicliques using Odd Cycle Transversals.

Kyle Kloster, Blair D. Sullivan, Andrew van der Poel

Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.

Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

A practical fpt algorithm for Flow Decomposition and transcript assembly.

Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2016

A Fast Parameterized Algorithm for Co-Path Set.

Blair D. Sullivan, Andrew van der Poel

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models.

Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel

Proceedings of the IEEE 16th International Conference on Data Mining, 2016