Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2016) Linearizable special cases of the QAP. Journal of Combinatorial Optimization, 31 (3). pp. 1269-1279. doi:10.1007/s10878-014-9821-2

Czumaj, Artur, Peng, Pan and Sohler, Christian (2016) Relating two property testing models for bounded degree directed graphs. In: 48th Annual ACM Symposium on Theory of Computing (STOC 2016), Cambridge, MA, 19-21 Jun 2016. Published in: STOC 2016 Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing pp. 1033-1045. ISBN 9781450341325. doi:10.1145/2897518.2897575

Czumaj, Artur, Peng, Pan and Sohler, Christian (2015) Testing cluster structure of graphs. In: Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, Oregon, 15-17 Jun 2015. Published in: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing pp. 723-732. ISBN 9781450335362. doi:10.1145/2746539.2746618

Englert, Matthias, Gupta, Anupam, Krauthgamer, Robert, Räcke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2014) Vertex sparsifiers : new results from old techniques. SIAM Journal on Computing, Volume 43 (Number 4). pp. 1239-1262. doi:10.1137/130908440

Englert, Matthias, Özmen, Deniz and Westermann, Matthias (2014) The power of reordering for online minimum makespan scheduling. SIAM Journal on Computing, Volume 43 (Number 3). pp. 1220-1237. doi:10.1137/130919738

Englert, Matthias, Matsakis, Nicolaos and Mucha, Marcin (2014) New bounds for online packing LPs. In: Latin American Theoretical INformatics (LATIN) 2014, Montevideo, Uruguay , 31 Mar- 4 Apr 2014. Published in: Lecture Notes in Computer Science series pp. 1-12. doi:10.1007/978-3-642-54423-1_28

Lozin, Vadim V., Mosca, Raffaele and Purcell, Christopher (2013) Sparse regular induced subgraphs in 2P3-free graphs. Discrete Optimization, Volume 10 (Number 4). pp. 304-309. doi:10.1016/j.disopt.2013.08.001

Lozin, Vadim V., Mayhill, Colin and Zamaraev, Victor (2011) A note on the speed of hereditary graph properties. The Electronic Journal of Combinatorics, Vol.18 (No.1). p. 157.

Deineko, Vladimir G., Shabtay, Dvir and Steiner, George (2011) On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. Journal of Heuristics, 17 (1). pp. 61-96. doi:10.1007/s10732-010-9127-1

Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2010) PTAS for k-tour cover problem on the plane for moderately large values of k. International Journal of Foundations of Computer Science, Volume 21 (Number 6). pp. 893-904. doi:10.1142/S0129054110007623

Dabrowski, Konrad, Lozin, Vadim V., Raman, Rajiv and Ries, Bernard (2010) Colouring vertices of triangle-free graphs. In: 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Zaros, Greece, 28-30 Jun 2010. Published in: Lecture Notes in Computer Science, Volume 6410 pp. 184-195. ISSN 0302-9743. doi:10.1007/978-3-642-16926-7_18

Krusche, Peter and Tiskin, Alexander (2010) Computing alignment plots efficiently. In: Chapman, Barbara and Desprez, Frédéric and Joubert, Gerhard R. and Lichnewsky, Alain and Peters, Frans and Priol, Thierry, (eds.) Parallel Computing: From Multicores and GPU's to Petascale. Advances in Parallel Computing, Volume 19 . IOS Press, pp. 158-165. ISBN 9781607505297

Brandstädt, Andreas, Lozin, Vadim V. and Mosca, Raffaele (2010) Independent sets of maximum weight in apple-free graphs. SIAM Journal on Discrete Mathematics, Vol.24 (No.1). pp. 239-254. doi:10.1137/090750822

Englert, Matthias, Raecke, Harald and Westermann, Matthias (2010) Reordering buffers for general metric spaces. Theory of Computing, Vol.6 (No.1). pp. 27-46. doi:10.4086/toc.2010.v006a002

Englert, Matthias, Gupta, A., Krauthgamer, Robert, Räcke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2010) Vertex sparsifiers : new results from old techniques. In: Serna, Maria and Shaltiel, Ronen and Jansen, Klaus and Rolim, José, (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science (6302). Springer Verlag, pp. 152-165. ISBN 9783642153686

Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2009) PTAS for k-tour cover problem on the plane for moderately large values of k. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), Honolulu, HI, December 16-18, 2009. Published in: Lecture Notes in Computer Science, 5878 pp. 994-1003. ISBN 978-3-642-10630-9. ISSN 0302-9743. doi:10.1007/978-3-642-10631-6_100

Lozin, Vadim V. and Volz, Jordan (2008) The clique-width of bipartite graphs in monogenic classes. International Journal of Foundations of Computer Science, Volume 19 (Number 2). pp. 477-494. doi:10.1142/S0129054108005772

Aziz, Haris and Paterson, Michael S. (2008) Variation in weighted voting games. Coventry: University of Warwick. Department of Computer Science. (Unpublished)