Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Yesmine Ben Amar
Barbara Aquilani
C. Delorme
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
T Yershov
Home
/
Author
/
OLLI POTTONEN
Author Info
Open Visualization
Name
Affiliation
Papers
OLLI POTTONEN
Aalto University, Department of Information and Computer Science and Helsinki Institute for Information Technology, Aalto, Finland
14
Collaborators
Citations
PageRank
22
86
8.99
Referers
Referees
References
140
191
139
Search Limit
100
191
Publications (14 rows)
Collaborators (22 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Complexity of metric dimension on planar graphs.
1
0.35
2017
Non-existence of a ternary constant weight $(16, 5, 15; 2048)$ diameter perfect code.
0
0.34
2014
Approximately Uniform Online Checkpointing with Bounded Memory.
2
0.37
2013
On the complexity of metric dimension
26
1.43
2012
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
2
0.37
2011
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
6
0.57
2011
Planar Metric Dimension is NP-complete
0
0.34
2011
Approximately uniform online checkpointing
1
0.36
2011
On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$
4
0.47
2011
The perfect binary one-error-correcting codes of length 15: part II-properties
19
1.37
2010
Properties of the Steiner Triple Systems of Order 19
8
1.00
2010
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs
2
0.39
2009
There exists no Steiner system S(4,5,17)
2
0.39
2008
The Steiner quadruple systems of order 16
13
1.24
2006
1