Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications at ISAAC

Below you find the list of all publications of the Algorithm Engineering group presented at the International Symposium on Algorithms and Computation (ISAAC).

[ 2020 ] [ 2016 ] [ 2015 ] [ 2012 ] [ 2011 ] [ 2008 ] [ 2007 ] [ 2006 ]

2020 [ nach oben ]

  • Multicommodity Flows in P... - Download
    Kumar, NikhilMulticommodity Flows in Planar Graphs with Demands on Faces. International Symposium on Algorithms and Computation (ISAAC) 2020
     

2016 [ nach oben ]

  • Building Clusters with Lo... - Download
    Abu-Khzam, Faisal N.; Bazgan, Cristina; Casel, Katrin; Fernau, HenningBuilding Clusters with Lower-Bounded Sizes. International Symposium on Algorithms and Computation (ISAAC) 2016: 4:1-4:13
     

2015 [ nach oben ]

  • Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, JannikMany-to-one Matchings with Lower Quotas: Algorithms and Complexity. International Symposium Algorithms and Computation (ISAAC) 2015: 176-187
     
  • The Benefit of Recombinat... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M.The Benefit of Recombination in Noisy Evolutionary Search. International Symposium of Algorithms and Computation (ISAAC) 2015: 140-150
     
  • Unbounded Discrepancy of ... - Download
    Friedrich, Tobias; Katzmann, Maximilian; Krohmer, AntonUnbounded Discrepancy of Deterministic Random Walks on Grids. International Symposium on Algorithms and Computation (ISAAC) 2015: 212-222
     

2012 [ nach oben ]

  • Parameterized Clique on S... - Download
    Friedrich, Tobias; Krohmer, AntonParameterized Clique on Scale-Free Networks. International Symposium on Algorithms and Computation (ISAAC) 2012: 659-668
     

2011 [ nach oben ]

  • Diameter and Broadcast Ti... - Download
    Friedrich, Tobias; Sauerwald, Thomas; Stauffer, AlexandreDiameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. International Symposium on Algorithms and Computation (ISAAC) 2011: 190-199
     

2008 [ nach oben ]

  • Average Update Times for ... - Download
    Friedrich, Tobias; Hebbinghaus, NilsAverage Update Times for Fully-Dynamic All-Pairs Shortest Paths. International Symposium of Algorithms and Computation (ISAAC) 2008: 692-703
     
  • Approximating the Volume ... - Download
    Bringmann, Karl; Friedrich, TobiasApproximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. International Symposium on Algorithms and Computation (ISAAC) 2008: 436-447
     

2007 [ nach oben ]

  • Average-Case Analysis of ... - Download
    Ajwani, Deepak; Friedrich, TobiasAverage-Case Analysis of Online Topological Ordering. International Symposium on Algorithms and Computation (ISAAC) 2007: 464-475
     

2006 [ nach oben ]

  • Deterministic Random Walk... - Download
    Doerr, Benjamin; Friedrich, TobiasDeterministic Random Walks on the Two-Dimensional Grid. International Symposium on Algorithms and Computation (ISAAC) 2006: 474-483