Year: 2008

  • M. Chimani, M. Jünger and M. Schulz. "Crossing Minimization meets Simultaneous Drawing". PacificVis. 2008. pp. 33-40. [More] [Bibtex]
  • C. Buchheim et al. "A branch-and-cut approach to the crossing number problem", Discrete Optimization, Vol. 5. 2008, pp. 373-388. [More] [Bibtex]
  • D. Emig et al. "Integrative Visual Analysis of the Effects of AlternativeSplicing on Protein Domain Interaction Networks", J. Integrative Bioinformatics, Vol. 5. 2008. [More] [Bibtex]
  • M. Jünger, S. G. Kobourov, M. Schulz and J. J. Fowler. "Characterizing Simultaneous Embedding with Fixed Edges", Electronic Notes in Discrete Mathematics, Vol. 31. 2008, pp. 41-44. [More] [Bibtex]
  • M. Chimani, C. Gutwenger, M. Jansen, K. Klein and P. Mutzel. "Computing Maximum C-Planar Subgraphs". Graph Drawing. 2008. pp. 114-120. [More] [Bibtex]
  • S. P. Borgatti, S. G. Kobourov, O. Kohlbacher and P. Mutzel. "Dagstuhl Seminar 08191: Graph Drawing". 2008. [More] [Bibtex]
  • M. Chimani, C. Gutwenger, P. Mutzel and H.-M. Wong. "Layer-Free Upward Crossing Minimization". WEA. 2008. pp. 55-68. [More] [Bibtex]
  • A. Estrella-Balderrama, E. Gassner, M. Jünger, M. Percan, M. Schaefer and M. Schulz. "Simultaneous geometric graph embeddings". GD'07: Proceedings of the 15th international conference on Graph drawing. 2008. pp. 280-290. [More] [Bibtex]
  • M. Jünger, S. G. Kobourov, M. Schulz and J. J. Fowler. "Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges". WG. 2008. pp. 146-158. [More] [Bibtex]
  • Y. Disser, M. Müller-Hannemann and M. Schnee. "Multi-criteria Shortest Paths in Time-Dependent Train Networks". WEA. 2008. pp. 347-361. [More] [Online version] [Bibtex]
  • L. Frede, M. Müller-Hannemann and M. Schnee. "Efficient On-Trip Timetable Information in the Presence of Delays". ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. M. Fischetti and P. Widmayer eds. 2008. [More] [Online version] [Bibtex]
  • B. Doerr, M. Gnewuch, P. Kritzer and F. Pillichshammer. "Component-by-component construction of low-discrepancy point sets of small size", Monte Carlo Methods and Applications, Vol. 14. 2008, pp. 129-149. [More] [Bibtex]
  • F. Eisenbrand and T. Rothvoß. "A PTAS for static priority real-time scheduling with resource augmentation". 35th international Colloquium on Automata, Languages and Programming (ICALP 2008). 2008. pp. 246-257. [More] [Online version] [Bibtex]
  • F. Eisenbrand and T. Rothvoß. "Static-priority real-time scheduling: Response time computation is NP-hard". 29th IEEE Real-Time Systems Symposium (RTSS 2008). 2008. pp. 397-406. [More] [Online version] [Bibtex]
  • L. Frias, J. Singler and P. Sanders. "Single-Pass List Partitioning". International Workshop on Multi-Core Computing Systems (MuCoCoS). 2008. [More] [Online version] [Bibtex]
  • L. Frias, J. Singler and P. Sanders. "Single-Pass List Partitioning", Scalable Computing: Practice and Experience, Vol. 9. 2008, pp. 179-184. [More] [Online version] [Bibtex]
  • J. Singler and B. Kosnik. "The libstdc++ parallel mode: Software Engineering Considerations". International Workshop on Multicore Software Engineering (IWMSE). 2008. [More] [Online version] [Bibtex]
  • C. Gutwenger, K. Klein and P. Mutzel. "Planarity Testing and Optimal Edge Insertion with Embedding Constraints", J. Graph Algorithms Appl., Vol. 12. 2008, pp. 73-95. [More] [Bibtex]
  • P. Mutzel. "Recent Advances in Exact Crossing Minimization (Extended Abstract)", Electronic Notes in Discrete Mathematics, Vol. 31. 2008, pp. 33-36. [More] [Bibtex]
  • B. Doerr, T. Friedrich and T. Sauerwald. "Quasirandom Rumor Spreading". 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2008. pp. 773-781. [More] [Bibtex]
  • H. Meyerhenke, B. Monien and T. Sauerwald. "A New Diffusion-based Multilevel Algorithm for Computing Graph Partitions of Very High Quality". Proc. 22nd International Parallel and Distributed Processing Symposium, (IPDPS'08). 2008. [More] [Bibtex]
  • T. Achterberg, T. Berthold, T. Koch and K. Wolter. "Constraint Integer Programming: A New Approach to Integrate CP and MIP". Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008. L. Perron and M. A. Trick eds. 2008. pp. 6-20. [More] [Bibtex]
  • C. Buchheim, F. Liers and M. Oswald. "A Basic Toolbox for Constrained Quadratic 0/1 Optimization". WEA 2008: Workshop on Experimental Algorithms. 2008. pp. 249-262. [More] [Online version] [Bibtex]

Year: 2007

  • U. Brandes et al.. "On Finding Graph Clusterings with Maximum Modularity". Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07). A. Br, Städt, D. Kratsch and H. Müller eds. 2007. pp. 121-132. [More] [Online version] [Bibtex]
  • D. Delling, M. Gaertler, R. Görke, Z. Nikoloski and D. Wagner. "Engineering the evaluation of clustering techniques". Proceedings of the European Conference of Complex Systems (ECCS'07). 2007. [More] [Online version] [Bibtex]
Results 226 - 250 of 271
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>