| Publication | Date of Publication | Type |
|---|
Reading articles online
| 2023-03-21 | Paper |
Near-optimal approximate shortest paths and transshipment in distributed and streaming models
| 2023-02-03 | Paper |
Improved online algorithm for fractional knapsack in the random order model
| 2022-10-19 | Paper |
Physarum-inspired multi-commodity flow dynamics
Theoretical Computer Science | 2022-05-17 | Paper |
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
SIAM Journal on Computing | 2021-05-27 | Paper |
Dynamic sparsification for quadratic assignment problems
| 2020-05-19 | Paper |
Convergence of the non-uniform physarum dynamics
Theoretical Computer Science | 2020-03-20 | Paper |
Convergence of the non-uniform directed physarum model
Theoretical Computer Science | 2020-03-20 | Paper |
Leveling the grid
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
A novel dual ascent algorithm for solving the min-cost flow problem
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Two results on slime mold computations
Theoretical Computer Science | 2019-05-21 | Paper |
Near-optimal distributed maximum flow
SIAM Journal on Computing | 2018-12-05 | Paper |
On the parameterized complexity of biclique cover and partition
| 2018-04-10 | Paper |
From DQBF to QBF by dependency elimination
| 2017-11-15 | Paper |
Energy-aware stage illumination
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
On guillotine cutting sequences
| 2017-08-31 | Paper |
Cliques in regular graphs and the core-periphery problem in social networks
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Near-optimal distributed maximum flow (extended abstract)
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
The interval constrained 3-coloring problem
Theoretical Computer Science | 2015-10-08 | Paper |
A Simple Efficient Interior Point Method for Min-Cost Flow
Algorithms and Computation | 2015-09-11 | Paper |
Nearly tight approximability results for minimum biclique cover and partition
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Algorithms for longer OLED lifetime
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Physarum can compute shortest paths: convergence proofs and complexity bounds
Automata, Languages, and Programming | 2013-08-07 | Paper |
Accelerated bend minimization
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
Accelerated bend minimization
Graph Drawing | 2012-03-09 | Paper |
Approximation algorithms for the interval constrained coloring problem
Algorithmica | 2011-09-20 | Paper |
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
Approximation and Online Algorithms | 2011-02-15 | Paper |
A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm
Operations Research Letters | 2010-12-20 | Paper |
The interval constrained 3-coloring problem
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Matching Techniques Ride to Rescue OLED Displays
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Multiline addressing by network flow
Algorithmica | 2009-05-06 | Paper |
ENERGY-AWARE STAGE ILLUMINATION
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
Approximating the Interval Constrained Coloring Problem
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
PACKING A TRUCK — NOW WITH A TWIST!
International Journal of Computational Geometry & Applications | 2008-05-20 | Paper |
Multiline Addressing by Network Flow
Lecture Notes in Computer Science | 2008-03-11 | Paper |
