| Physarum-inspired multi-commodity flow dynamics | 0 | 0.34 | 2022 |
| Near-Optimal Approximate Shortest Paths And Transshipment In Distributed And Streaming Models | 0 | 0.34 | 2021 |
| Improved Online Algorithm for Fractional Knapsack in the Random Order Model. | 0 | 0.34 | 2021 |
| Scanning the Issue. | 0 | 0.34 | 2020 |
| Combinatorial Optimization of Graphical User Interface Designs | 1 | 0.35 | 2020 |
| Reading Articles Online | 0 | 0.34 | 2020 |
| Convergence of the non-uniform directed Physarum model | 1 | 0.35 | 2019 |
| Convergence of the non-uniform Physarum dynamics | 1 | 0.35 | 2019 |
| Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering. | 0 | 0.34 | 2018 |
| Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. | 5 | 0.40 | 2017 |
| From DQBF to QBF by Dependency Elimination. | 2 | 0.36 | 2017 |
| Two Results on Slime Mold Computations. | 1 | 0.35 | 2017 |
| Computational Support for Functionality Selection in Interaction Design. | 1 | 0.35 | 2017 |
| An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. | 0 | 0.34 | 2016 |
| Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks. | 0 | 0.34 | 2016 |
| Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. | 6 | 0.58 | 2016 |
| A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. | 2 | 0.37 | 2016 |
| On the Parameterized Complexity of Biclique Cover and Partition. | 0 | 0.34 | 2016 |
| Near-Optimal Distributed Maximum Flow: Extended Abstract | 8 | 0.52 | 2015 |
| P. polycephalum Can Compute Shortest Paths. | 0 | 0.34 | 2015 |
| Near-Optimal Distributed Maximum Flow | 4 | 0.43 | 2015 |
| The interval constrained 3-coloring problem | 4 | 0.47 | 2015 |
| A Simple Efficient Interior Point Method for Min-Cost Flow. | 0 | 0.34 | 2014 |
| Improvements to keyboard optimization with integer programming | 9 | 0.60 | 2014 |
| Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. | 3 | 0.48 | 2014 |
| A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem. | 1 | 0.35 | 2013 |
| Physarum can compute shortest paths: convergence proofs and complexity bounds | 10 | 0.79 | 2013 |
| Leveling the Grid. | 0 | 0.34 | 2012 |
| Recovering missing coefficients in DCT-transformed images | 8 | 0.49 | 2012 |
| Blinking Molecule Tracking | 0 | 0.34 | 2012 |
| Accelerated bend minimization | 3 | 0.41 | 2011 |
| Approximation Algorithms for the Interval Constrained Coloring Problem | 2 | 0.40 | 2011 |
| Sorted Sector Covering Combined With Image Condensation - An Efficient Method For Local Dimming Of Direct-Lit And Edge-Lit Lcds | 5 | 0.79 | 2010 |
| A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks | 2 | 0.42 | 2010 |
| Computing H/D-exchange rates of single residues from data of proteolytic fragments. | 11 | 0.41 | 2010 |
| A combinatorial algorithm for the 1-median problem in Rd with the Chebyshev norm | 1 | 0.38 | 2010 |
| Matching Techniques Ride to Rescue OLED Displays | 0 | 0.34 | 2009 |
| An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling. | 0 | 0.34 | 2009 |
| Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments | 4 | 0.53 | 2009 |
| Multiline Addressing by Network Flow | 3 | 0.64 | 2009 |
| Energy-aware stage illumination | 0 | 0.34 | 2008 |
| Computing H/D-exchange speeds of single residues from data of peptic fragments | 13 | 0.83 | 2008 |
| Approximating the Interval Constrained Coloring Problem | 8 | 0.70 | 2008 |
| Algorithms for longer OLED lifetime | 3 | 0.88 | 2007 |
| Packing a trunk: now with a twist! | 11 | 0.80 | 2005 |
