Alex Popa

View my complete CV

Assistant Professor

Faculty of Informatics
Masaryk University


Botanická 68a
602 00 Brno
Czech Republic

E-mail: popa "at" fi "dot" muni "dot" cz



Research interests

  • Algorithms for NP-hard problems
  • String algorithms and bioinformatics
  • Interactive systems and parallel computing. I am working with Professor Gheorghe Stefanescu from University of Bucharest in developing AGAPIA language , a programming language for interactive systems.
  • Classification algorithms
  • Previous employment

  • Postdoctoral Researcher - Aalto University, Finland . October 2011 - August 2013
  • Education

  • PhD - University of Bristol . August 2008 - September 2011

  • Bachelors - University of Bucharest . October 2005 - July 2008
  • Publications

  • Enumerating Cube Tilings . Discrete and Computational Geometry. K Ashik Mathew, Patric R. J. Östergård, Alexandru Popa

  • On the Shannon Capacity of Triangular Graphs . Electronic Journal of Combinatorics. K Ashik Mathew, Patric R. J. Östergård, Alexandru Popa

  • The Mendelsohn Triple Systems of Order 13 . Journal of Combinatorial Designs. Mahdad Khatirinejad, Patric R. J. Östergård, Alexandru Popa

  • The 2-Paths Min-Sum Orientation Problem . WAOA 2013. Trevor Fenner, Oded Lachish, Alexandru Popa

  • Modelling the Power Supply Network - Hardness and Approximation . TAMC 2013. Alexandru Popa

  • Synthesizing Minimal Tile Sets for Complex Patterns in the framework of Patterned DNA Self-Assembly . Theoretical Computer Science. Eugen Czeizler, Alexandru Popa

  • Approximating the Rainbow - Better Lower and Upper Bounds . COCOON 2012. Alexandru Popa

  • Synthesizing Minimal Tile Sets for Complex Patterns in the framework of Patterned DNA Self-Assembly . DNA 2012. Eugen Czeizler, Alexandru Popa

  • On the Closest String via Rank Distance . CPM 2012. Liviu Dinu, Alexandru Popa

  • Hardness and Approximation of The Asynchronous Border Minimization Problem . TAMC 2012. Alexandru Popa, Prudence W.H. Wong and Fencol C.C. Yung

  • Restricted Common Superstring and Restricted Common Supersequence . CPM 2011. Raphael Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

  • Maximum Subset Intersection. Information Processing Letters. Raphael Clifford and Alexandru Popa

  • On Shortest Common Superstring and Swap Permutations . SPIRE 2010. Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

  • Approximation and hardness results for the maximum edge q-coloring problem. ISAAC 2010. Anna Adamaszek, Alexandru Popa

  • (In)approximability results for pattern matching problems . Prague Stringology Conference 2010 (PSC 2010). Raphael Clifford, Alexandru Popa

  • Generalised Matching. SPIRE 2009. Raphael Clifford, Aram Harrow, Alexandru Popa, Benjamin Sach.

  • Undecidability Results for Finite Interactive Systems . ROMJIST (Romanian Journal of Information Science and Technology) . Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu.

  • Undecidability Results for Finite Interactive Systems . Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu. SYNASC 2008.

  • Interactive systems with registers and voices and AGAPIA language. Alexandru Popa. Bachelor Thesis, Faculty of Mathematics and Computer Science, University of Bucharest, June 2008

  • High-level Structured Interactive Programs with Registers and Voices. JUCS (Journal of Universal Computer Science) Alexandru Popa, Alexandru Sofronia, Gheorghe Stefanescu.

  • Preprints

  • The min-max edge q-coloring problem . Tommi Larjomaa, Alexandru Popa

  • Algorithmic and Hardness Results for the Colorful Components Problems. Anna Adamaszek, Alexandru Popa

  • Awards

  • "Biocentrum Helsinki: Connecting Aalto University and University of Helsinki Scientists” research grant (5000 euros) - joint with Elodie Renvoisé - 13 December 2012.
  • Travel grant to attend the 12th Max Planck Advanced Course on the Foundations of Computer Science, August 29 - September 2, 2011, Saarbrücken, Germany.
  • Yahoo! Research student support to attend SPIRE 2010, Los Cabos, Mexico, 11-13 October 2010
  • Studentship to attend the DIMAP Workshop on Extremal and Probabilistic Combinatorics, Petersfield, Hampshire, England, 18 - 25 July 2010
  • Fellowship to attend 26th Annual British Colloquium on Theoretical Computer Science (BCTCS 2010), Edinburgh, 6-9 April 2010
  • Fellowship to attend 25th Annual British Colloquium on Theoretical Computer Science (BCTCS 2009), Warwick, 6-9 April 2009
  • Special prize at FameLab 2008 final Romania , Bucharest, Romania, 17 May 2008
  • Thrid place at FameLab 2008 regional selection , Bucharest, Romania, April 2008
  • Erasmus study grant at University of Bristol, Department of Computer Science , September 2007 - January 2008
  • Member of Romanian National Team of Informatics, 2005
  • Special mention at Romanian National Olympiads in Informatics, 2004
  • Special mention at Romanian National Informatics Contest "Great Prize of National Palace of Children", 2004
  • First prize at Romanian National Informatics Contest "Great Prize of National Palace of Children", 2003
  • Universities visited

  • MPI - July 2013 - hosted by Dr. Anna Adamaszek
  • Marne-la-Vallée University - October 2012 - hosted by Dr. Guillaume Blin
  • Tsinghua University - May 2012
  • University of Liverpool - March 2011 - hosted by Dr. Prudence W.H. Wong
  • KTH Royal Institute of Technology - September 2010 - hosted by Prof. Johan Håstad
  • University of Bar-Ilan - May 2010 - hosted by Prof. Moshe Lewenstein
  • University of Warwick - February 2010 - hosted by Dr. Anna Adamaszek
  • University of Warwick - August 2009 - hosted by Dr. Oded Lachish
  • University of Illinois at Urbana-Champaign - January 2009 - hosted by Prof. Gheorghe Stefanescu
  • Events and Summer Schools

  • 12th Max Planck Advanced Course on the Foundations of Computer Science, August 29 - September 2, 2011, Saarbrücken, Germany.
  • DIMAP Workshop on Extremal and Probabilistic Combinatorics, Petersfield, Hampshire, England, 18 - 25 July 2010
  • DIMAP Summer School on Approximation and Randomized Algorithms, University of Warwick, England, 12 - 16 July 2010
  • 10th Max Planck Advanced Course on the Foundations of Computer Science, September 14 - 18, 2009, Saarbrücken, Germany.
  • LMS-EPSRC Short Course 'Probabilistic Combinatorics', Cambridge, 12-17 July 2009.
  • Beautiful Science Networking Event, Istanbul, Turkey, 23-26 October 2008.
  • Talks

  • The 2-Paths Min-Sum Orientation Problem. WAOA 2013, Sophia Antipolis, France, 5-6 September 2013.
  • The Asynchronous Border Minimization Problem. MPI, Saarbrücken, Germany, 16 July, 2013.
  • The Mendelsohn Triple Systems of Order 13. NORCOM 2013, Stockholm, 17-19 June 2013.
  • Modelling the Power Supply Network - Hardness and Approximation. TAMC 2013, Hong Kong, 20-22 May 2013.
  • The maximum edge q-coloring problem. Masaryk University, Brno, Czech Republic, 16 january, 2013.
  • Instant Scientific Talk Contest - Aalto University Science Day (random talk). Espoo, Finland, 20 September 2012.
  • The Asynchronous Border Minimization Problem. Marne-la-Vallée University, Champs-sur-Marne, France, 2 October, 2012.
  • Approximating the Rainbow - Better Lower and Upper Bounds. COCOON 2012, Sydney, Australia, 20-22 August, 2012
  • Hardness and Approximation of The Asynchronous Border Minimization Problem. TAMC 2012, Beijing, China, 16-21 May, 2012.
  • Computers are nothing without maths! from ScienceSLAM Helsinki, 13 December 2011.
  • The maximum edge q-coloring problem. University of Helsinki, Helsinki, Finland, 2 December 2011.
  • The maximum edge q-coloring problem. University of Liverpool, Liverpool, United Kingdom, 17 March 2011.
  • Approximation and hardness results for the maximum edge q-coloring problem. ISAAC 2010, Jeju Island, South Korea, 15-17 December 2010.
  • On Shortest Common Superstring and Swap Permutations. SPIRE 2010, Los Cabos, Mexico, 11-13 October 2010.
  • Approximation and hardness results for the maximum edge q-coloring problem. KTH Royal Institute of Technology, Stockholm, Sweden, 24 September, 2010.
  • (In)approximability results for pattern matching problems. Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010.
  • Tree Decomposition of Graphs. DIMAP Workshop on Extremal and Probabilistic Combinatorics, Petersfield, Hampshire, England, 18 - 25 July 2010
  • Permuted Common Supersequence . BCTCS 2010 . University of Edinburgh, 6-9 April 2010.
  • (In)approximability results for problems inspired from biology . University of Bucharest, 29 March 2010.
  • Colouring 3-Colourable Graphs Using SDP . Theory of Computing Reading Group. University of Bristol, 4 December 2009.
  • Online Computation and Competitive Analysis . Theory of Computing Reading Group. University of Bristol, 16 October 2009.
  • Generalized Matching . SPIRE 2009 . Saariselkä, Finland, 25-27 August 2009.
  • Bourgain's Embedding Theorem . Theory of Computing Reading Group. University of Bristol, 23 July 2009.
  • Farytales about Hardness. Theory of Computing Reading Group. University of Bristol, 4 June 2009.
  • Generalized Matching . BCTCS 2009 . University of Warwick, 6-9 April 2009.
  • Generalized Matching . Departmental Seminar. University of Bristol, 2 April 2009.
  • Tree Embeddings . Theory of Computing Reading Group. University of Bristol, 19 February 2009.
  • Scheduling Processes on Machines. Theory of Computing Reading Group. University of Bristol, 27 November 2008.
  • Counting problems. Theory of Computing Reading Group. University of Bristol, 6 November 2008.
  • Interactive Systems with Registers and Voices. Students Communications Session, Bucharest, June 2008
  • Interactive Programs with Registers and Voices - Foundations. GlobalComp Workshop , Technical University Cluj-Napoca, Romania, 26 February 2008
  • High Level Structured Programs with Registers and Voices: Agapia v0.2 Language. GlobalComp Workshop , Technical University Cluj-Napoca, Romania, 26 February 2008
  • Teaching

    Masaryk University
  • Teaching Assistant - Compuational Logic (Fall 2013).
  • Teaching Assistant - Graph Theory (Fall 2013).
  • Teaching Assistant - Mathematical Foundations of Computer Science (Fall 2013).

  • University of Bristol
  • Teaching Assistant - Theory of Computation (Spring 2011).
  • Teaching Assistant - Theory of Computation (Spring 2010).
  • Teaching Assistant - Advanced Algorithms (Fall 2009).
  • Teaching Assistant - Theory of Computation (Spring 2009).
  • A few teaching assistance hours on Data Structures and Algorithms (Fall 2008).
  • A few lectures on Advanced Algorithms (Fall 2008).
  • Teaching Assistant - Advanced Algorithms (Fall 2008).
  • Student supervision

    Past
  • Ioannis Marcoullis , University of Bristol, MSc 2011
  • Tommi Larjomaa , Aalto University, MSc 2013
  • K Ashik Mathew , Aalto University, doctoral student (co-supervisor)

  • Current
  • Tomás Hebelka , Masaryk University, doctoral student (co-supervisor)
  • Community service

  • Program committee member: CONTENT 2012, CONTENT 2013, FUTURE COMPUTING 2013.
  • Reviewer: Theoretical Computer Science, Algorithmica, Journal of Discrete Algorithms, Discrete Applied Mathematics, MFCS 2013, ISAAC 2013, UCNC 2013, WABI 2012, COCOON 2012, CCS 2011, ICALP 2011
  • Non-academic achievements and activities

  • Recently I have travelled to North Korea and I wrote a book about this experience. While I am still trying to find a publisher for the book, you can read a short article about the trip here .
  • I like very much literature and poetry (both reading and writing). To view my poems (in Romanian) click here. Please e-mail me if you have any suggestions or critics regarding the poems.
  • I have published the essay O noua forma de libertate (joint work with Oana Gabroveanu) in Gheorghe Paun's magazine Curtea de la Arges .
  • I have published a poem in the collective volume Antologia vinovatelor placeri. Some of the co-authors of this volume are the artists Mircea Albulescu, Tudor Gheorghe and Dorel Visan.
  • Special metion at the International Poetry Contest in Romanian Language STARPRESS 2010 (5612 participants).
  • I have published several poems in Antologia scriitorilor romani din intreaga lume - STARPRESS 2011.
  • I have published eight poems in the collective volume Ce enigmatica esti, femeie... .
  • I also like to play the guitar.
  • Some of my dangerous hobbies are motorcycling and horse riding.
  • I have yellow belt at Judo.