|
2
|
Upper bounds on the number of hidden nodes in the Sugiyama algorithm
– Arne Frick
- 1997
|
|
1
|
Algorithmic Approach to Non-symmetric 3-class Association Schemes
– Leif K. Jørgensen
|
|
5
|
Switching of edges in strongly regular graphs. I. A family of partial difference sets on 100 vertices
– L. K. Jørgensen, M. Klin
- 2003
|
|
11
|
Variable Neighborhood Search for Extremal Graphs 6. Analyzing Bounds for the Connectivity Index
– Pierre Hansen, Etudes Commerciales
- 2000
|
|
2
|
The Graphlet System (System Demonstration)
– Michael Himsolt
- 1997
|
|
4
|
Advances in the Theory and Practice of Graph Drawing
– Roberto Tamassia
- 1996
|
|
4
|
Interactive Graph Drawing on the World Wide Web
– Ulfar Erlingsson, Mukkai Krishnamoorthy
- 1996
|
|
14
|
Graph Drawing
– Roberto Tamassia
- 1997
|
|
1
|
Counting Transitive Relations
– Götz Pfeiffer
|
|
18
|
Fast and Simple Horizontal Coordinate Assignment
– Ulrik Brandes, Boris Köpf
- 2002
|
|
2
|
Drawing Recurrent Hierarchies
– Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Raymund Fülöp, Michael Kaufmann
- 2011
|
|
|
Drawing Recurrent Hierarchies
– Christian Bachmaier Franz, J. Brandenburg Wolfgang, Brunner Raymund Fülöp, M. Kaufmann
- 2011
|
|
5
|
Computation in Permutation Groups: Counting and Randomly Sampling Orbits
– Leslie Ann Goldberg
|
|
2
|
LINK: A Combinatorics and Graph Theory Workbench for Applications and Research
– Jon Berry, Nathaniel Dean, Patricia Fasel, Mark Goldberg, Elizabeth Johnson, John Maccuish, Gregory Shannon, Steven Skiena
- 1995
|
|
6
|
Crossing Reduction by Windows Optimization
– Thomas Eschbach, Wolfgang Günther, Rolf Drechsler, Bernd Becker
- 2002
|
|
4
|
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
– Matthias Stallmann, Franc Brglez, Debabrata Ghosh
|
|
|
“Evaluation and optimization of innovative production systems of goods and services” HYBRID META-HEURISTICS FOR UNIFORM PARALLEL MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME
– M. Zaïdi, B. Jarboui, T. Loukil, I. Kacem
|
|
|
BICLIQUE COMPLETION PROBLEM: MODELS AND ALGORITHMS
– Politecnico Di Milano, Relatore Prof, Francesco Maffioli, Correlatore Ing, Stefano Gualandi, Claudio Patrizio Magni, Anno Accademico Sommario
|
|
151
|
Variable Neighborhood Search
– Pierre Hansen, Nenad Mladenovic
- 1997
|
