| Publication | Date of Publication | Type |
|---|
On the parallel complexity of the alternating Hamiltonian cycle problem
| 2024-07-05 | Paper |
Task assignment in distributed systems using network flow methods
| 2024-07-05 | Paper |
NC algorithms for antidirected hamiltonian paths and cycles in tournaments
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Scheduling MapReduce jobs on identical and unrelated processors
Theory of Computing Systems | 2020-07-02 | Paper |
Scheduling MapReduce jobs under multi-round precedences
| 2018-01-11 | Paper |
Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
European Journal of Operational Research | 2017-12-06 | Paper |
Bin packing with colocations
Approximation and Online Algorithms | 2017-04-04 | Paper |
Speed scaling for maximum lateness
Theory of Computing Systems | 2016-03-09 | Paper |
Energy-efficient algorithms for non-preemptive speed-scaling
Approximation and Online Algorithms | 2015-11-20 | Paper |
On multiprocessor temperature-aware scheduling problems
Journal of Scheduling | 2014-08-18 | Paper |
Bounded max-colorings of graphs
Journal of Discrete Algorithms | 2014-04-28 | Paper |
Approximating the throughput by coolest first scheduling
Approximation and Online Algorithms | 2013-09-13 | Paper |
Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Improved approximation algorithms for the max edge-coloring problem
Information Processing Letters | 2013-04-04 | Paper |
Speed scaling for maximum lateness
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On multiprocessor temperature-aware scheduling problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
The \textsc{max quasi-independent set} problem
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
Improved approximation algorithms for the max-edge coloring problem
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
On the max-weight edge coloring problem
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
Bounded Max-colorings of Graphs
Algorithms and Computation | 2010-12-09 | Paper |
Approximating the max-edge-coloring problem
Theoretical Computer Science | 2010-08-11 | Paper |
The max quasi-independent set Problem
Computer Science – Theory and Applications | 2010-06-22 | Paper |
A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
Information Processing Letters | 2010-04-19 | Paper |
Approximating the max edge-coloring problem
Lecture Notes in Computer Science | 2009-12-11 | Paper |
On the Maximum Edge Coloring Problem
Approximation and Online Algorithms | 2009-02-12 | Paper |
The densest \(k\)-subgraph problem on clique graphs
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
Selfish Routing and Path Coloring in All-Optical Networks
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
Approximating a Class of Classification Problems
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Scheduling trees with large communication delays on two identical processors
Journal of Scheduling | 2007-12-20 | Paper |
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics | 2006-04-28 | Paper |
Scheduling in switching networks with set-up delays
Journal of Combinatorial Optimization | 2005-05-17 | Paper |
scientific article; zbMATH DE number 2090581 (Why is no real title available?)
| 2004-08-12 | Paper |
A PTAS for the average weighted completion time problem on unrelated machines.
Journal of Scheduling | 2003-07-27 | Paper |
scientific article; zbMATH DE number 1839470 (Why is no real title available?)
| 2002-12-02 | Paper |
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
RAIRO - Theoretical Informatics and Applications | 2001-04-26 | Paper |
On the parallel complexity of the alternating Hamiltonian cycle problem
RAIRO - Operations Research | 2000-08-24 | Paper |
scientific article; zbMATH DE number 1424438 (Why is no real title available?)
| 2000-03-23 | Paper |
A sufficient condition for maximum cycles in bipartite digraphs
Discrete Mathematics | 2000-03-02 | Paper |
Scheduling UET-UCT series-parallel graphs on two processors
Theoretical Computer Science | 1997-09-10 | Paper |
scientific article; zbMATH DE number 927063 (Why is no real title available?)
| 1997-01-28 | Paper |
