Matthias F. Stallmann

Networks, 2021

2020

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver.

[BibT_eX]

[DOI]

Yang Ho

Timothy D. Goodrich

CoRR, 2020

2017

Algorithm Animation with Galant.

[BibT_eX]

[DOI]

IEEE Computer Graphics and Applications, 2017

2016

On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems.

[BibT_eX]

[DOI]

Wenbin Chen

Nagiza F. Samatova

William Hendrix

Weiqin Ying

Theor. Comput. Sci., 2016

2014

Including blind people in computing through access to graphs.

[BibT_eX]

[DOI]

Suzanne Balik

Sean P. Mealin

Robert D. Rodman

Michelle L. Glatz

Veronica J. Sigler

Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility, 2014

2013

GSK: universally accessible graph sketching.

[BibT_eX]

[DOI]

Suzanne Balik

Sean P. Mealin

Robert D. Rodman

Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Integrating communication skills in data structures and algorithms courses.

[BibT_eX]

[DOI]

William Eberle

John Karro

Neal Lerner

Proceedings of the IEEE Frontiers in Education Conference, 2013

2012

A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2012

2009

Systematic Exploration of Efficient Query Plans for Automated Database Restructuring.

[BibT_eX]

[DOI]

Maxim Kormilitsin

Rada Chirkova

Yahya Fathi

Proceedings of the Advances in Databases and Information Systems, 2009

2008

Preface.

[BibT_eX]

[DOI]

Rajeev Raman

Zohreh Asgharzadeh Talebi

ACM J. Exp. Algorithmics, 2008

Exact and inexact methods for selecting views and indexes for OLAP performance improvement.

[BibT_eX]

[DOI]

Rada Chirkova

Yahya Fathi

Proceedings of the EDBT 2008, 2008

View and index selection for query-performance improvement: quality-centered algorithms and heuristics.

[BibT_eX]

[DOI]

Maxim Kormilitsin

Rada Chirkova

Yahya Fathi

Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007

The directional p.

[BibT_eX]

[DOI]

Laura E. Jackson

George N. Rouskas

Eur. J. Oper. Res., 2007

A case for smaller class size with integrated lab for introductory computer science.

[BibT_eX]

[DOI]

Kristy Elizabeth Boyer

Rachael S. Dwight

Carolyn S. Miller

C. Dianne Raubenheimer

Mladen A. Vouk

Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

ProofChecker: an accessible environment for automata theory correctness proofs.

[BibT_eX]

[DOI]

Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

High-contrast algorithm behavior: observation, hypothesis, and experimental design.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Experimental Computer Science, 2007

2005

On SAT instance classes and a method for reliable performance experiments with SAT solvers.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2005

Effective bounding techniques for solving unate and binate covering problems.

[BibT_eX]

[DOI]

Proceedings of the 42nd Design Automation Conference, 2005

2003

Optimal one-page tree embeddings in linear time.

[BibT_eX]

[DOI]

Robert A. Hochberg

Inf. Process. Lett., 2003

A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

New bounds on the barycenter heuristic for bipartite graph drawing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization.

[BibT_eX]

[DOI]

Debabrata Ghosh

ACM J. Exp. Algorithmics, 2001

2000

Minimizing the complexity of an activity network.

[BibT_eX]

[DOI]

Jerzy Kamburowski

David J. Michael

Networks, 2000

1999

Evaluating iterative improvement heuristics for bigraph crossing minimization.

[BibT_eX]

[DOI]

Debabrata Ghosh

Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

Heuristics and Experimental Design for Bigraph Crossing Number Minimization.

[BibT_eX]

[DOI]

Debabrata Ghosh

Proceedings of the Algorithm Engineering and Experimentation, 1999

1995

On Embedding Binary Trees into Hypercubes.

[BibT_eX]

[DOI]

Woei-Kae Chen

J. Parallel Distributed Comput., 1995

1993

On counting planar embeddings.

[BibT_eX]

[DOI]

Discret. Math., 1993

Fast Algorithms for One-Dimensional Compaction with Jog Insertion.

[BibT_eX]

[DOI]

Thomas A. Hughes

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

Optimal Reductions of Two-Terminal Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Wolfgang W. Bein

Jerzy Kamburowski

SIAM J. Comput., 1992

GDR: A Visualization Tool for Graph Algorithms.

[BibT_eX]

[DOI]

Rance Cleaveland

Prashant Hebbar

Proceedings of the Computational Support for Discrete Mathematics, 1992

1991

A characterization of network representable polymatroids.

[BibT_eX]

[DOI]

Wolfgang W. Bein

Peter Brucker

ZOR Methods Model. Oper. Res., 1991

A One-Way Array Algorithm for Matroid Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

1990

Unconstrained via minimization for topological multilayer routing.

[BibT_eX]

[DOI]

Thomas A. Hughes

Wentai Liu

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

Solving Some Combinatorial Problems on Arrays with One-Way Dataflow.

[BibT_eX]

[DOI]

Carla D. Savage

Jo Ellen Perry

Algorithmica, 1990

1989

Hypercube embedding heuristics: An evaluation.

[BibT_eX]

[DOI]

Woei-Kae Chen

Edward F. Gehringer

Int. J. Parallel Program., 1989

1986

An augmenting path algorithm for linear matroid parity.

[BibT_eX]

[DOI]

Harold N. Gabow

Comb., 1986

1985

Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract).

[BibT_eX]

[DOI]

Harold N. Gabow

Proceedings of the Automata, 1985

1984

An Augmenting Path Algorithm for the Parity Problem on Linear Matroids

[BibT_eX]

[DOI]