Person:586335: Difference between revisions

From MaRDI portal
Person:586335
m AuthorDisambiguator moved page Person:244219 to Christos D. Zaroliagis: Duplicate
m AuthorDisambiguator moved page Christos D. Zaroliagis to Christos D. Zaroliagis: Duplicate
 
(No difference)

Latest revision as of 13:23, 7 December 2023

Available identifiers

zbMath Open zaroliagis.christos-dMaRDI QIDQ586335

List of research outcomes

PublicationDate of PublicationType
Optimal parallel shortest paths in small treewidth digraphs2023-05-08Paper
On the computation of fast data transmissions in networks with capacities and delays2022-12-16Paper
Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs2022-12-09Paper
Efficient parallel algorithms for shortest paths in planar graphs2022-12-09Paper
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems2022-08-18Paper
An axiomatic approach to time-dependent shortest path oracles2022-03-22Paper
Dynamic interpolation search revisited2020-01-17Paper
https://portal.mardi4nfdi.de/entity/Q52401292019-10-24Paper
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles2019-09-12Paper
Engineering Oracles for Time-Dependent Road Networks2019-09-12Paper
Shortest path queries in digraphs of small treewidth2019-01-10Paper
Hierarchical Time-Dependent Oracles2018-04-19Paper
Planar spanners and approximate shortest path queries among obstacles in the plane2017-12-05Paper
On-line and dynamic algorithms for shortest path problems2017-12-04Paper
Engineering graph-based models for dynamic timetable information systems2017-11-09Paper
An experimental study of algorithms for fully dynamic transitive closure2017-06-15Paper
An Experimental Study of Dynamic Algorithms for Transitive Closure2017-06-15Paper
All-pairs min-cut in sparse networks2017-01-19Paper
Distance oracles for time-dependent networks2016-05-31Paper
A Glimpse at Paul G. Spirakis2016-01-27Paper
An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs2016-01-27Paper
Simple Parallel Algorithms for Dynamic Range Products2016-01-27Paper
D 3-Tree: A Dynamic Deterministic Decentralized Structure2015-11-19Paper
\(D^2\)-tree: a new overlay with deterministic bounds2015-09-02Paper
Distance oracles for time-dependent networks2014-07-01Paper
Engineering planar separator algorithms2014-04-01Paper
Improved Alternative Route Planning2014-02-24Paper
An experimental study of bicriteria models for robust timetabling2013-12-19Paper
https://portal.mardi4nfdi.de/entity/Q28473872013-09-09Paper
https://portal.mardi4nfdi.de/entity/Q28473882013-09-09Paper
A New Dynamic Graph Structure for Large-Scale Transportation Networks2013-06-07Paper
Improved bounds for finger search on a RAM2013-05-13Paper
On Assessing Robustness in Transportation Planning2012-09-28Paper
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies2012-09-28Paper
QoS-aware Multicommodity Flows and Transportation Planning ?2012-09-28Paper
Robust Line Planning in Case of Multiple Pools and Disruptions2011-05-12Paper
ISB-tree: A new indexing scheme with efficient expected behaviour2011-01-20Paper
D2-Tree: A New Overlay with Deterministic Bounds2010-12-09Paper
On the efficient generation of prime-order elliptic curves2010-09-21Paper
Algorithms - ESA 20032010-03-03Paper
Incentive-Compatible Robust Line Planning2009-12-03Paper
Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications2009-09-18Paper
https://portal.mardi4nfdi.de/entity/Q33923972009-08-14Paper
Dynamic Interpolation Search Revisited2009-03-12Paper
Efficient models for timetable information in public transportation systems2008-06-20Paper
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications2008-04-24Paper
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations2008-03-17Paper
Progress in Cryptology - INDOCRYPT 20032007-11-29Paper
Algorithms and Computation2006-11-14Paper
Stochastic Algorithms: Foundations and Applications2006-10-20Paper
Algorithms – ESA 20052006-06-27Paper
Algorithms – ESA 20052006-06-27Paper
Geometric containers for efficient shortest-path computation2006-01-16Paper
Algorithms – ESA 20042005-08-18Paper
Attack propagation in networks2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44257172003-09-11Paper
https://portal.mardi4nfdi.de/entity/Q44176802003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44176812003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44113962003-07-08Paper
https://portal.mardi4nfdi.de/entity/Q47077852003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q47855812003-01-05Paper
Shortest paths in digraphs of small treewidth. I: Sequential algorithms2001-05-17Paper
A simple parallel algorithm for the single-source shortest path problem on planar digraphs2001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q45257102001-01-24Paper
Improved algorithms for dynamic shortest paths2000-11-14Paper
Transmissions in a network with capacities and delays1999-06-29Paper
Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms1999-01-12Paper
All-Pairs Min-Cut in Sparse Networks1998-11-11Paper
A parallel priority queue with constant time operations1998-11-05Paper
Efficient computation of implicit representations of sparse graphs1998-06-23Paper
The fourth moment in Luby's distribution1997-02-28Paper
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q46947261993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40365751993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40280981993-03-28Paper
Efficient parallel algorithms for shortest paths in planar digraphs1992-12-14Paper
https://portal.mardi4nfdi.de/entity/Q39759351992-06-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Christos D. Zaroliagis