Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Shany Infanto
Claudia Calabrese
Miodrag Kapetanovic
Hao Mao
Feifei Liu
Peter Malec
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
MATTHIAS F. M. STALLMANN
Author Info
Open Visualization
Name
Affiliation
Papers
MATTHIAS F. M. STALLMANN
North Carolina State University, Department of Computer Science, Raleigh NC 27695 – 7534, United States
23
Collaborators
Citations
PageRank
25
166
19.38
Referers
Referees
References
300
349
219
Search Limit
100
349
Publications (23 rows)
Collaborators (25 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Efficient Algorithms For Finding2-Mediansof A Tree
0
0.34
2021
Algorithm Animation with Galant.
0
0.34
2017
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
0
0.34
2009
Exact and inexact methods for selecting views and indexes for OLAP performance improvement
15
0.62
2008
View and index selection for query-performance improvement: quality-centered algorithms and heuristics
3
0.38
2008
The directional p
1
0.35
2007
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation
6
0.45
2003
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
12
0.70
2001
Minimizing the complexity of an activity network
7
0.51
2000
Evaluating iterative improvement heuristics for bigraph crossing minimization
2
0.42
1999
Heuristics and Experimental Design for Bigraph Crossing Number Minimization
6
0.55
1999
On embedding binary trees into hypercubes
17
0.83
1995
On counting planar embeddings
1
0.39
1993
Fast Algorithms for One-Dimensional Compaction with Jog Insertion
0
0.34
1993
Optimal reduction of two-terminal directed acyclic graphs
36
5.00
1992
Towards Characterizing Network Representable Polymatroids
0
0.34
1991
A one-way array algorithm for matroid scheduling
0
0.34
1991
Unconstrained via minimization for topological multilayer routing
8
1.44
1990
Solving Some Combinatorial Problems on Arrays with One-Way Dataflow
1
0.37
1990
Hypercube embedding heuristics: an evaluation
11
1.13
1989
An augmenting path algorithm for linear matroid parity
31
2.79
1986
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract)
2
0.61
1985
An Augmenting Path Algorithm For The Parity Problem On Linear Matroids
7
0.81
1984
1
