| Inclusion/exclusion meets measure and conquer JMM van Rooij, J Nederlof, TC van Dijk European Symposium on Algorithms, 554-565, 2009 | 84 | 2009 |
| A cubic kernel for feedback vertex set and loop cutset HL Bodlaender, TC van Dijk Theory of Computing Systems 46 (3), 566-597, 2010 | 42 | 2010 |
| Computing treewidth with LibTW T van Dijk, JP van den Heuvel, W Slob Citeseer. http://citeseerx. ist. psu. edu/viewdoc/download, 2006 | 25 | 2006 |
| Integer maximum flow in wireless sensor networks with energy constraint HL Bodlaender, RB Tan, TC van Dijk, J van Leeuwen Scandinavian Workshop on Algorithm Theory, 102-113, 2008 | 21 | 2008 |
| Interactive focus maps using least-squares optimization TC van Dijk, JH Haunert International Journal of Geographical Information Science 28 (10), 2052-2075, 2014 | 19 | 2014 |
| How to eat a graph: Computing selection sequences for the continuous generalization of road networks M Chimani, TC van Dijk, JH Haunert Proceedings of the 22nd ACM SIGSPATIAL international conference on advances …, 2014 | 17 | 2014 |
| Simultaneous drawing of planar graphs with right-angle crossings and few bends MA Bekos, TC van Dijk, P Kindermann, A Wolff International Workshop on Algorithms and Computation, 222-233, 2015 | 16 | 2015 |
| Inclusion/exclusion meets measure and conquer J Nederlof, JMM van Rooij, TC van Dijk Algorithmica 69 (3), 685-740, 2014 | 15 | 2014 |
| Active learning for classifying template matches in historical maps B Budig, TC Van Dijk International Conference on Discovery Science, 33-47, 2015 | 13 | 2015 |
| Matching labels and markers in historical maps: an algorithm with interactive postprocessing B Budig, TCV Dijk, A Wolff ACM Transactions on Spatial Algorithms and Systems (TSAS) 2 (4), 1-24, 2016 | 11 | 2016 |
| Polygon consensus: smart crowdsourcing for extracting building footprints from historical maps B Budig, TC van Dijk, F Feitsch, MG Arteaga Proceedings of the 24th ACM SIGSPATIAL international conference on advances …, 2016 | 9 | 2016 |
| Accentuating focus maps via partial schematization T van Dijk, A van Goethem, JH Haunert, W Meulemans, B Speckmann Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances …, 2013 | 9 | 2013 |
| Map schematization with circular arcs TC van Dijk, A van Goethem, JH Haunert, W Meulemans, B Speckmann International Conference on Geographic Information Science, 1-17, 2014 | 7 | 2014 |
| Realtime linear cartograms and metro maps TC van Dijk, D Lutz Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018 | 6 | 2018 |
| Improved approximation algorithms for box contact representations MA Bekos, TC Van Dijk, M Fink, P Kindermann, S Kobourov, S Pupyrev, ... Algorithmica 77 (3), 902-920, 2017 | 6 | 2017 |
| Block Crossings in Storyline Visualizations. TC van Dijk, M Fink, N Fischer, F Lipp, P Markfelder, A Ravsky, S Suri, ... J. Graph Algorithms Appl. 21 (5), 873-913, 2017 | 6 | 2017 |
| Block crossings in storyline visualizations TC van Dijk, M Fink, N Fischer, F Lipp, P Markfelder, A Ravsky, S Suri, ... International Symposium on Graph Drawing and Network Visualization, 382-398, 2016 | 6 | 2016 |
| Location‐dependent generalization of road networks based on equivalent destinations TC van Dijk, JH Haunert, J Oehrlein Computer Graphics Forum 35 (3), 451-460, 2016 | 6 | 2016 |
| Computing treewidth with LibTW, 2006 T van Dijk, JP van den Heuvel, W Slob Accessed 2017-06-16. URL: http://www. treewidth. com/treewidth, 0 | 6 | |
| Computing storyline visualizations with few block crossings TC van Dijk, F Lipp, P Markfelder, A Wolff International Symposium on Graph Drawing and Network Visualization, 365-378, 2017 | 5 | 2017 |
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgGeverifieerd e-mailadres voor uni-wuerzburg.de
