| Publication | Date of Publication | Type |
|---|
Giant components in random temporal graphs
SIAM Journal on Discrete Mathematics | 2026-04-17 | Paper |
Making the interval membership width of temporal graphs connected and bidirectional
Journal of Computer and System Sciences | 2025-09-29 | Paper |
| The way we were: structural operational semantics research in perspective | 2025-07-24 | Paper |
| Making the interval membership width of temporal graphs connected and bidirectional | 2025-02-28 | Paper |
| Giant components in random temporal graphs | 2025-01-14 | Paper |
| Parallel approximation of optimization problems | 2024-06-21 | Paper |
| Upward drawings of search trees (extended abstract) | 2024-06-05 | Paper |
On Computing the Diameter of (Weighted) Link Streams
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Thirty years of SIROCCO a data and graph mining comparative analysis of its temporal evolution
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Minimum vertex cover, distributed decision-making, and communication complexity
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
Networks | 2023-12-18 | Paper |
Structure in approximation classes
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| On computing the diameter of (weighted) link streams | 2023-06-23 | Paper |
| A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs | 2023-04-03 | Paper |
| The parallel complexity of approximating the High Degree Subgraph problem | 2023-03-21 | Paper |
| Trade-offs in distributed interactive proofs | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7559396 (Why is no real title available?) | 2022-07-18 | Paper |
| Giant Components in Random Temporal Graphs | 2022-05-30 | Paper |
On computing Pareto optimal paths in weighted time-dependent networks
Information Processing Letters | 2021-03-11 | Paper |
Computing top-k closeness centrality faster in unweighted graphs
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Improving the betweenness centrality of a node by adding links
ACM Journal of Experimental Algorithmics | 2018-11-20 | Paper |
An axiomatic and an average-case analysis of algorithms and heuristics for metric properties of graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Into the square: on the complexity of some quadratic-time solvable problems
(available as arXiv preprint) | 2016-08-05 | Paper |
Rumor spreading in random evolving graphs
Random Structures & Algorithms | 2016-03-22 | Paper |
On the complexity of the shortest-path broadcast problem
Discrete Applied Mathematics | 2015-12-10 | Paper |
On computing the hyperbolicity of real-world graphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Synchronous context-free grammars and optimal linear parsing strategies
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
Theoretical Computer Science | 2015-05-26 | Paper |
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Adding test generation to the teaching machine
ACM Transactions on Computing Education | 2014-04-15 | Paper |
On computing the diameter of real-world undirected graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Rumor spreading in random evolving graphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Smooth movement and Manhattan path based random waypoint mobility
Information Processing Letters | 2013-04-04 | Paper |
Minimum ratio cover of matrix columns by extreme rays of its induced cone
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Theoretical Computer Science | 2012-10-11 | Paper |
Parsimonious flooding in dynamic graphs
Distributed Computing | 2012-02-06 | Paper |
A comparison of three algorithms for approximating the distance distribution in real-world graphs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Finding the diameter in real-world graphs. Experimentally turning a lower bound into an upper bound
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Spatial node distribution of Manhattan path based random waypoint mobility models with applications
Structural Information and Communication Complexity | 2010-02-24 | Paper |
The minimum likely column cover problem
Information Processing Letters | 2009-07-09 | Paper |
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
On-line load balancing made simple: greedy strikes back
Journal of Discrete Algorithms | 2008-05-16 | Paper |
| scientific article; zbMATH DE number 2188419 (Why is no real title available?) | 2005-07-26 | Paper |
Optimal covering designs: complexity results and new bounds
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2080210 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079633 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 2077131 (Why is no real title available?) | 2004-07-01 | Paper |
On-line algorithms for the channel assignment problem in cellular networks.
Discrete Applied Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038778 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1982178 (Why is no real title available?) | 2003-09-16 | Paper |
Text sparsification via local maxima.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1848288 (Why is no real title available?) | 2003-02-04 | Paper |
On the Hamming distance of constraint satisfaction problems.
Theoretical Computer Science | 2003-01-21 | Paper |
On weighted vs unweighted versions of combinatorial optimization problems
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1775449 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1688358 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1560337 (Why is no real title available?) | 2001-04-26 | Paper |
On approximating a scheduling problem
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
On approximation scheme preserving reducibility and its applications
Theory of Computing Systems | 2000-06-07 | Paper |
Max NP-completeness made easy
Theoretical Computer Science | 2000-01-12 | Paper |
Structure in Approximation Classes
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1330033 (Why is no real title available?) | 1999-09-01 | Paper |
Sperner's lemma and robust machines
Computational Complexity | 1999-05-09 | Paper |
Strictly-upward drawings of ordered search trees
Theoretical Computer Science | 1999-01-12 | Paper |
The parallel complexity of approximating the high degree subgraph problem
Theoretical Computer Science | 1999-01-12 | Paper |
Linear area upward drawings of AVL trees
Computational Geometry | 1998-04-13 | Paper |
On the distributed decision-making complexity of the minimum vertex cover problem
RAIRO - Theoretical Informatics and Applications | 1997-12-04 | Paper |
Approximate solution of NP optimization problems
Theoretical Computer Science | 1997-02-28 | Paper |
Reversible simulation of space-bounded computations
Theoretical Computer Science | 1997-02-28 | Paper |
Complexity classes and sparse oracles
Journal of Computer and System Sciences | 1995-07-24 | Paper |
| scientific article; zbMATH DE number 578252 (Why is no real title available?) | 1994-05-29 | Paper |
AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS
International Journal of Foundations of Computer Science | 1994-01-26 | Paper |
A note on the descriptive complexity of maximization problems
Information Processing Letters | 1994-01-13 | Paper |
A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry | 1993-05-16 | Paper |
A uniform approach to define complexity classes
Theoretical Computer Science | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 17535 (Why is no real title available?) | 1992-06-26 | Paper |
Minimum-delay schedules in layered networks
Acta Informatica | 1992-06-25 | Paper |
Completeness in approximation classes
Information and Computation | 1991-01-01 | Paper |
Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
Information Processing Letters | 1990-01-01 | Paper |
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
