References
[1] F. N. Abu-Khzam, E. Bonnet, and F. Sikora. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. In Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, volume 8986 of LNCS, pages 1–12. Springer, 2014.
[2] C. Bazgan, M. Chopin, A. Nichterlein, and F. Sikora. Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms, 27:54–65, 2014.
[3] H. Bodlaender, F. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, and D. Thilikos. (Meta) kernelization. In 50th Annual IEEE Symposium on Foundations of Computer Science, (FOCS 2009). IEEE, 2009.
[4] E. Bonnet and F. Sikora. The graph motif problem parameterized by the structure of the input graph. Discrete Applied Mathematics, pages –, 2016.
[5] K. K. Dabrowski, P. A. Golovach, P. van ’t Hof, D. Paulusma, and D. M. Thilikos. Editing to a planar graph of given degrees. In 10th International Computer Science Symposium in Russia, CSR 2015, pages 143–156, 2015.
[6] E. D. Demaine, M. T. Hajiaghayi, N. Nishimura, P. Ragde, and D. M. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. System Sci., 69(2):166–195, 2004.
[7] J. Díaz, J. Petit, and D. M. Thilikos. Experimental Algorithms: 5th International Workshop, WEA 2006, chapter Kernels for the Vertex Cover Problem on the Preferred Attachment Model, pages 231–240. Springer, 2006.
[8] F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos. Bidimensionality and kernels. In 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pages 503–510. ACM-SIAM, 2010.
[9] J. Gajarský, M. Lampis, and S. Ordyniak. Parameterized algorithms for modular-width. In Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, pages 163–176, 2013.
[10] V. Garnero, C. Paul, I. Sau, and D. M. Thilikos. Explicit linear kernels via dynamic programming. SIAM J. Discrete Math., 29(4):1864–1894, 2015.
[11] A. C. Giannopoulou, M. J. Kaminski, and D. M. Thilikos. Forbidding kuratowski graphs as immersions. Journal of Graph Theory, 78(1):43–60, 2015.
[12] A. C. Giannopoulou and D. M. Thilikos. Optimizing the graph minors weak structure theorem. SIAM J. Discrete Math., 27(3):1209–1227, 2013.
[13] C. Giatsidis, B. Cautis, S. Maniu, D. M. Thilikos, and M. Vazirgiannis. Quantifying trust dynamics in signed graphs, the s-cores approach. In SIAM International Conference on Data Mining, pages 668–676, 2014.
[14] C. Giatsidis, F. D. Malliaros, D. M. Thilikos, and M. Vazirgiannis. CoreCluster: A degeneracy based graph clustering framework. In AAAI, pages 44–50, 2014.
[15] C. Giatsidis, F. D. Malliaros, N. Tziortziotis, C. Dhanjal, E. Kiagias, D. M. Thilikos, and M.
[16] C. Giatsidis, D. Thilikos, and M. Vazirgiannis. Evaluating cooperation in communities with the k-core structure. In ASONAM, pages 87–93, 2011[17] C. Giatsidis, D. M. Thilikos, and M. Vazirgiannis. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst., 35(2):311–343, 2013.
[18] A. Grigoriev, A. Koutsonas, and D. M. Thilikos. Bidimensionality of geometric intersection graphs. In SOFSEM 2014: Theory and Practice of Computer Science, volume 8327 of Lecture Notes in Computer Science, pages 293–305. Springer, 2014.
[19] J. Jeong, E. J. Kim, and S. Oum. Constructive algorithm for path-width of matroids. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1695–1704, 2016.
[20] E. Kim, S. Oum, C. Paul, I. Sau, and D. M. Thilikos. An FPT 2-approximation for tree-cut decomposition. In Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, pages 35–46, 2015.
[21] E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single- exponential algorithms via protrusion decompositions. ACM Trans. Algorithms, 12(2):21, 2016.
[22] E. J. Kim, C. Paul, I. Sau, and D. M. Thilikos. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. In 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, pages 78–89, 2015.
[23] M. Lampis. Algorithmic meta-theorems for restrictions of treewidth. Algorithmica, 64(1):19–37, 2012.
[24] M. Lampis. Parameterized approximation schemes using graph widths. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pages 775–786, 2014.
[25] F. D. Malliaros, A. N. Papadopoulos, and M. Vazirgiannis. Core decomposition in graphs: Concepts, algorithms and applications. In Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15-16, 2016, Bordeaux, France, March 15-16, 2016., pages 720–721, 2016.
[26] F. D. Malliaros, M.-E. G. Rossi, and M. Vazirgiannis. Locating influential nodes in complex networks. Sci. Rep., 2016.
[27] F. D. Malliaros and M. Vazirgiannis. Clustering and community detection in directed networks: A survey. Physics Reports, 533(4):95 – 142, 2013. Clustering and Community Detection in Directed Networks: A Survey.
[28] P. Meladianos, G. Nikolentzos, F. Rousseau, Y. Stavrakas, and M. Vazirgiannis. Degeneracy-based real-time sub-event detection in twitter stream. In ICWSM’15, 2015, pages 248–257, 2015.
[29] G. Nikolentzos, P. Meladianos, and M. Vazirgiannis. Matching Node Embeddings for Graph Similarity. In Proceedings of the 31st AAAI Conference in Artificial Intelligence, pages 2429–2435, 2017.
[30] F. Rousseau, E. Kiagias, and M. Vazirgiannis. Text Categorization as a Graph Classification Problem. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics, pages 1702– 1712, 2015.
[31] F. Rousseau and M. Vazirgiannis. Graph-of-word and TW-IDF: New Approach to Ad Hoc IR. In Pro- ceedings of the 22nd ACM International Conference on Information and Knowledge Management, pages 59–68, 2013.