Hi!

me

Welcome to my home page!

My name is Julia, I’m a software engineer with math background. I’m based in Zürich, Switzerland.

Recently I completed the DAS in Data Science program at ETH, specializing in Image Analysis and Computer vision. Previously I worked at Archilogic as a machine learning engineer, working on automation projects related to digital interior spaces (check out some demos here).

Earlier, I worked in the Data Mining and Search Group of MTA SZTAKI (Institute for Computer Science and Control of the Hungarian Academy of Sciences), starting to move into coding and data science.

In the past I worked as a research assistant at Egerváry Research Group (EGRES) at the Operations Research Department of the Mathematics Institute of Eötvös University, Budapest. My main research area was polyhedral combinatorics and complexity questions regarding linear systems. I also worked on topics in combinatorial optimization, graph theory and game theory, such as stable matchings or games on multicommodity flows. I completed my PhD in 2013 under the supervision of András Frank, you can find my thesis here.

My CV (pdf).

Projects

Rubber band method

I reimplemented a program by László Lovász that demonstrates several graph algorithms, all based on one core idea: imagining the graph as a physical object with rubber bands as edges. This concept can be used to design a variety of algorithms:

  • drawing planar graphs in the plane
  • testing k-connectivity
  • approximating the maximum cut
  • tiling rectangles with squares

Check it out here! Like the original, it’s an interactive visualization of these algorithms, alongside explanations and references. It is geared toward students and researchers interested in graph theory, but others might also enjoy playing around with it.

Notes of ETH classes

Here are some of my notes (in Notion) on classes I’ve taken at ETH Zürich as part of the DAS program:

  • Computer Vision class taught by Marc Pollefeys, Siyu Tang and Fisher Yu.

  • Big Data class taught by Ghislain Fourny.

Theses

I completed both my MSc in Mathematics and PhD in Applied Mathematics under the supervision of András Frank at Eötvös University, Budapest.

PhD thesis:

Integrality, complexity and colourings in polyhedral combinatorics

Master’s thesis:

Stabil párosítások struktúrája és poliéderei

(Structure and polyhedra of stable matchings), 2005, in Hungarian.

Publications

Published papers

  • R. Pálovics, P. Szalai, J. Pap, E. Frigó, L. Kocsis, A.A. Benczúr
    Location-aware online learning for top-k recommendation
    Pervasive and Mobile Computing, Vol. 38, Part 2, July 2017, pp 490-504. Journal link

  • R. Pálovics, B. Daróczy, A.A. Benczúr, J. Pap, L. Ermann, S. Phan, A.D. Chepelianskii, D.L. Shepelyansky
    Statistical analysis of Nomao customer votes for spots of France
    The European Physical Journal B, August 2015, Vol. 88, Issue 194. Journal link

  • A. Frank, T. Király, J. Pap, D. Pritchard
    Characterizing and recognizing generalized polymatroids
    Mathematical Programming, August 2014, Vol. 146, Issue 1, pp 245-273.. Journal link
    Preprint: EGRES Technical Report no. 2012-03

  • T. Király, J. Pap
    Stable multicommodity flows
    Algorithms Vol. 6, Issue 1 (2013), pp 161-168. Journal link (open access)

  • T. Király, J. Pap
    PPAD-completeness of polyhedral versions of Sperner's Lemma
    Discrete Mathematics Vol. 313, Issue 15 (2013), pp 1594-1599. Journal link
    Preprint: EGRES Technical Report no. 2012-04

  • A. Bernáth, T. Király, E.R. Kovács, G. Mádi-Nagy, Gy. Pap, J. Pap, J. Szabó, L. Végh
    Algorithms for multiplayer multicommodity flow problems
    Central European Journal of Operations Research, Volume 21 (2013), pp 699-712..
    Preprint: EGRES Technical Report no. 2012-09

  • J. Pap
    Recognizing Conic TDI Systems is Hard
    Mathematical Programming, Vol. 128, Issue 1-2 (2011), pp 43-48.
    Preprint: EGRES Technical Report no. 2008-15

  • T. Király, J. Pap
    Ideal set functions
    7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Kyoto (2011), pp 332-340.

  • T. Király, J. Pap
    Kernels, stable matchings, and Scarf's Lemma
    RIMS Kokyuroku Bessatsu B23: Combinatorial Optimization and Discrete Algorithms, (ed. S. Iwata), (2010), pp 131-145.
    Preprint: EGRES Technical Report no. 2008-13

  • T. Király, J. Pap
    A note on kernels and Sperner's Lemma
    Discrete Applied Mathematics, Vol. 157, Issue 15 (2009), pp 3327-3331.

  • T. Király, J. Pap
    Total dual integrality of Rothblum's description of the stable marriage polyhedron
    Mathematics of Operations Research Vol. 33 Issue 2 (2008), pp 283-290.
    Preprint: EGRES Technical Report no. 2005-01

Papers in preparation, Technical reports and Quick proofs

Other

  • K. Bérczi, A. Frank, V. Kaszanitzky, C. Király, T. Király, E.R. Kovács, G. Pap, J. Pap, Operációkutatás példatár, (Operations research exercises), online lecture notes (in Hungarian).

  • L. Végh, T. Király, J. Pap, Játékelmélet jegyzet, (Game theory lecture notes, in Hungarian)