Babette van Antwerpen-de Fluiter

According to our database, Babette van Antwerpen-de Fluiter authored at least 10 papers between 1995 and 2004.

Collaborative distances:

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

2004

Operational planning of a large-scale multi-modal transportation system.

Benjamin Jansen, Pieter C. J. Swinkels, Geert J. A. Teeuwen, Babette van Antwerpen-de Fluiter, Hein A. Fleuren

Eur. J. Oper. Res., 2004

2001

Reduction Algorithms for Graphs of Small Treewidth.

Hans L. Bodlaender, Babette van Antwerpen-de Fluiter

Inf. Comput., 2001

Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two.

Hans L. Bodlaender, Babette van Antwerpen-de Fluiter

Algorithmica, 2001

1999

Isomorphism for Graphs of Bounded Distance Width.

Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos

Algorithmica, 1999

1997

Parallel Algorithms for Treewidth Two.

Babette de Fluiter, Hans L. Bodlaender

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

The complexity of generalized retiming problems.

Babette van Antwerpen-de Fluiter, Emile H. L. Aarts, Jan H. M. Korst, Wim F. J. Verhaegh, Albert van der Werf

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

On Intervalizing K-colored Graphs for DNA Physical Mapping.

Hans L. Bodlaender, Babette van Antwerpen-de Fluiter

Discret. Appl. Math., 1996

Parallel Algorithms for Series Parallel Graphs.

Hans L. Bodlaender, Babette de Fluiter

Proceedings of the Algorithms, 1996

Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth.

Hans L. Bodlaender, Babette de Fluiter

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Intervalizing k-Colored Graphs.

Hans L. Bodlaender, Babette de Fluiter

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995