Networks

Conference proceedings 2015

2017

 2016

2015

  2014

 

2015

  • Fast computation of categorical richness on raster datasets and related problems
    de Berg M., Tsirogiannis, C., and Wilkinson, B.
    In:  Proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015.
  • Finding Pairwise Intersections Inside a Query Range?
    M. de Berg, J. Gudmundsson, A.D. Mehrabi. In Proc. 14th Algorithms and Data Structures Symposium (WADS), LNCS 9214, pages 236–248, 2015.
  • Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
    Bodlaender, H., Heggernes, P.,  Telle, J.A. Electronic Notes in Discrete Mathematics49: 559-568 (2015). Proceedings of EUROCOMB 2015.

  • Round Elimination in Exact Communication Complexity

    Briët, J., Buhrman, H., Leung, D , Piovesan, T., Speelman, F.

    10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) Leibniz International Proceedings in Informatics, 44, Brussels, Belgium, p.206–225.
  • Tight Hardness of the Non-Commutative Grothendieck Inequality
    Briët, J., Regev, O., and Saket, R.
    Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on, pp.1108-1122, 17-20 Oct. 2015
  • Uniform kernelization complexity of hitting forbidden minors
    Giannopoulou, A.C., Jansen, B.M.P., Lokshtanov, D., and  Saurabh, S. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015. Volume 9134 of LNCS. 2015, pages 629–641. doi: 10.1007/978-_3-_662-_47672-_7_51.

  • Characterizing the easy-to-find subgraphs from the viewpoint of
    polynomial-time algorithms, kernels, and Turing kernels
    B.M.P. Jansen, D. Marx. SODA '15. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms Pages 616-629 San Diego, California 4-6 January 2015.
  • On structural parameterizations of hitting set: Hitting paths in graphs using 2-SAT
    Jansen, B.M.P. In: Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, pages 472–486, 17-19 June 2015, Munich, Germany.
  • A structural approach to kernels for ILPs: Treewidth and Total Unimodularity
    B M.P. Jansen, S. Kratsch. In: Proceedings of the 23rd European Symposium on Algorithms, ESA 2015. Volume 9294 of LNCS. 2015, pages 779–791, 14-16 September 2015, Patras, Greece.
  • Sparsification upper and lower bounds for graph problems and not-all-equal SAT
    Jansen, B.M.P., and Pieterse, A., . In: Proceedings of the 10th International Symposium on Parameterized and Exact Computation, IPEC 2015. Volume 43 of LIPIcs. 2015, pages 163–174. doi: 10.4230/LIPIcs.IPEC.2015.163., 16-18 September 2015. Patras, Greece.
  • Delayed workload shifting in many-server systems
    van Leeuwaarden, J.S.H., Mathijsen, B.W.J., Sloothaak, F. ACM SIGMETRICS Performance Evaluation Review, 43(2), 10-12.