| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt |
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Kurt Mehlhorn, Adrian Neumann |
Remarks on Category-Based Routing in Social Networks |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga |
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Jörg-Rüdiger Sack |
CGTA-Awards 2011. |
Comput. Geom. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma |
Physarum can compute shortest paths. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer |
Certifying algorithms. |
Computer Science Review |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Michael Sagraloff |
A deterministic algorithm for isolating real roots of a real polynomial. |
J. Symb. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Halperin, Kurt Mehlhorn |
Guest Editorial: Selected Papers from European Symposium on Algorithms. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail |
New Approximation Algorithms for Minimum Cycle Bases of Graphs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt |
Weisfeiler-Lehman Graph Kernels. |
Journal of Machine Learning Research |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma |
Physarum Can Compute Shortest Paths |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff |
A general approach to the analysis of controlled perturbation algorithms. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Kurt Mehlhorn, Monique Teillaud |
Computational Geometry (Dagstuhl Seminar 11111). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah, Pascal Schweitzer |
An Introduction to Certifying Algorithms. |
it - Information Technology |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arno Eigenwillig, Kurt Mehlhorn |
Multiplication of Long Integers - Faster than Long Multiplication. |
Algorithms Unplugged |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga |
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun |
Approximate Counting of Cycles in Streams. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer |
Online Graph Exploration: New Results on Old and New Algorithms. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
The Physarum Computer. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah |
Verification of Certifying Computations. |
CAV |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Saurabh Ray |
Faster algorithms for computing Hong's bound on absolute positiveness. |
J. Symb. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre |
Assigning Papers to Referees. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
Additive spanners and (alpha, beta)-spanners. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein |
Arrangements on Parametric Surfaces I: General Framework and Infrastructure. |
Mathematics in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Jörg-Rüdiger Sack |
Editorial. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Pascal Schweitzer |
Progress on Certifying Algorithms. |
FAW |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Reliable and Efficient Geometric Computing. |
ICMS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig |
Cycle bases in graphs characterization, algorithms, complexity, and applications. |
Computer Science Review |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt |
A Separation Bound for Real Algebraic Expressions. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Separation bound, Zero testing, Exact geometric computation |
| 1 | Nino Shervashidze, S. V. N. Vishwanathan, Tobias Petri, Kurt Mehlhorn, Karsten M. Borgwardt |
Efficient graphlet kernels for large graph comparison. |
Journal of Machine Learning Research - Proceedings Track |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Dimitrios Michail |
Minimum cycle bases: Faster and simpler. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks |
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi |
Breaking the O(m2n) Barrier for Minimum Cycle Bases. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Assigning Papers to Referees. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Michael Sagraloff |
Isolating real roots of real polynomials. |
ISSAC |
2009 |
DBLP DOI BibTeX RDF |
bisection algorithm, bitstream coefficient, descartes' rule of sign, real polynomial, root isolation |
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Cycle basis, Cycle space, Matrix multiplication, Polynomial algorithms |
| 1 | Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap |
Classroom examples of robustness problems in geometric computations. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
Faster Algorithms for Minimum Cycle Basis in Directed Graphs. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arno Eigenwillig, Kurt Mehlhorn |
Multiplikation langer Zahlen (schneller als in der Schule). |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Peter Sanders |
Algorithms and Data Structures: The Basic Toolbox. |
|
2008 |
DOI RDF |
|
| 1 | Dan Halperin, Kurt Mehlhorn (eds.) |
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings |
ESA |
2008 |
DBLP BibTeX RDF |
|
| 1 | Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, Evangelia Pyrga |
Cycle bases of graphs and sampled manifolds. |
Computer Aided Geometric Design |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
level maximal, Bipartite matching, strong stability, stable marriage |
| 1 | Telikepalli Kavitha, Kurt Mehlhorn |
Algorithms to Compute Minimum Cycle Basis in Directed Graphs. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn |
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. |
Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn |
Popular Matchings. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein |
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Minimum Cycle Bases in Graphs Algorithms and Applications. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail |
New Approximation Algorithms for Minimum Cycle Bases of Graphs. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Matchings in Graphs Variations of the Problem. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Werner Krandick, Kurt Mehlhorn |
New bounds for the Descartes method. |
J. Symb. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
Rank-maximal matchings. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
maximum cardinality matching, one-sided preference lists, Bipartite matching |
| 1 | Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki |
Matching Algorithms Are Fast in Sparse Random Graphs. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad |
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Dimitrios Michail |
Implementing minimum cycle basis algorithms. |
ACM Journal of Experimental Algorithmics |
2006 |
DBLP DOI BibTeX RDF |
Cycle basis, graph algorithms |
| 1 | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama |
Polyline Fitting of Planar Points under Min-sum Criteria. |
Int. J. Comput. Geometry Appl. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Reliable and Efficient Geometric Computing. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff |
Reliable and Efficient Computational Geometry Via Controlled Perturbation. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert |
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. |
Reliable Implementation of Real Number Algorithms |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap |
Reply to "Backward Error Analysis ...". |
ICCSA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Reliable Geometric Computing. |
OR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Reliable and Efficient Geometric Computing. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Funke, Kurt Mehlhorn, Stefan Näher |
Structural filtering: a paradigm for efficient and exact geometric programs. |
Comput. Geom. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert |
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
New constructions of (alpha, beta)-spanners and purely additive spanners. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt |
Controlled perturbation for Delaunay triangulations. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
controlled perturbation, oating point computation, randomized incremental construction, delaunay triangulations, convex hulls, randomized incremental algorithm |
| 1 | David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn |
Popular matchings. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders |
Towards Optimal Multiple Selection. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn |
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (eds.) |
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 |
Cache-Oblivious and Cache-Aware Algorithms |
2005 |
DBLP BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Dimitrios Michail |
Implementing Minimum Cycle Basis Algorithms. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn |
Pareto Optimality in House Allocation Problems. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
Minimum Cycle Bases and Surface Reconstruction. |
Graph Drawing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert |
A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. |
CASC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap |
Classroom Examples of Robustness Problems in Geometric Computations. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn |
Point containment in the integer hull of a polyhedron. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
Rank-maximal matchings. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
A Faster Algorithm for Minimum Cycle Basis of Graphs. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki |
Matching Algorithms Are Fast in Sparse Random Graphs. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn |
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. |
Cache-Oblivious and Cache-Aware Algorithms |
2004 |
DBLP BibTeX RDF |
|
| 1 | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama |
Polyline Fitting of Planar Points Under Min-sum Criteria. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn |
Pareto Optimality in House Allocation Problems. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Kwek, Kurt Mehlhorn |
Optimal search for rationals. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Peter Sanders |
Scanning Multiple Sequences Via Cache Memory. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Bast, Kurt Mehlhorn, Guido Schäfer |
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Single-source shortest-path problem, Weighted bipartite matching problem, Assignment problem, Dijkstra's algorithm |
| 1 | Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel |
An efficient graph algorithm for dominance constraints. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Michael Seel |
Infimaximal Frames: A Technique for Making Lines Look Like Segments. |
Int. J. Comput. Geometry Appl. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel |
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber |
Certifying and repairing solutions to large LPs how good are LP-solvers? |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad |
Certifying algorithms for recognizing interval graphs and permutation graphs. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Banderier, René Beier, Kurt Mehlhorn |
Smoothed Analysis of Three Combinatorial Problems. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
The Reliable Algorithmic Software Challenge RASC. |
WEA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
The Reliable Algorithmic Software Challenge RASC. |
Computer Science in Perspective |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan |
All-pairs shortest-paths computation in the presence of negative cycles. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Funke, Kurt Mehlhorn |
LOOK: A Lazy Object-Oriented Kernel design for geometric computation. |
Comput. Geom. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Guido Schäfer |
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. |
ACM Journal of Experimental Algorithmics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn |
SCIL - Symbolic Constraints in Integer Linear Programming. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn, Ulrich Meyer |
External-Memory Breadth-First Search with Sublinear I/O. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")