Dimitrios Michail

According to our database1, Dimitrios Michail authored at least 26 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Parallelization of large-scale drug-protein binding experiments.
Future Generation Comp. Syst., 2019

JGraphT - A Java library for graph data structures and algorithms.
CoRR, 2019

2017
Parallelization of Large-Scale Drug-Protein Binding Experiments.
Proceedings of the 2017 International Conference on High Performance Computing & Simulation, 2017

2016
Fair Matchings and Related Problems.
Algorithmica, 2016

2014
Wildfire monitoring using satellite images, ontologies and linked geospatial data.
J. Web Semant., 2014

2013
Fair Matchings and Related Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
TELEIOS: A Database-Powered Virtual Earth Observatory.
PVLDB, 2012

Real Time Fire Monitoring Using Semantic Web and Linked Data Technologies.
Proceedings of the ISWC 2012 Posters & Demonstrations Track, 2012


2011
An experimental comparison of single-sided preference matching algorithms.
ACM Journal of Experimental Algorithmics, 2011

New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Algorithmica, 2011

Bounded Unpopularity Matchings.
Algorithmica, 2011

2009
Minimum cycle bases: Faster and simpler.
ACM Trans. Algorithms, 2009

Cycle bases in graphs characterization, algorithms, complexity, and applications.
Computer Science Review, 2009

2008
An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.
Algorithmica, 2008

Bounded Unpopularity Matchings.
Proceedings of the Algorithm Theory, 2008

2007
Reducing rank-maximal to maximum weight matching.
Theor. Comput. Sci., 2007

Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem.
ACM Trans. Algorithms, 2007

Cycle bases of graphs and sampled manifolds.
Computer Aided Geometric Design, 2007

New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Proceedings of the STACS 2007, 2007

2006
Rank-maximal matchings.
ACM Trans. Algorithms, 2006

Implementing minimum cycle basis algorithms.
ACM Journal of Experimental Algorithmics, 2006

2005
Implementing Minimum Cycle Basis Algorithms.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.
Proceedings of the STACS 2004, 2004

Rank-maximal matchings.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A Faster Algorithm for Minimum Cycle Basis of Graphs.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004


  Loading...