Gregor Lagodzinski
This is an archived page of a former group member.
Research Interests
Originally being a mathematician my interests are tending towards more abstract concepts like
- Graph Theory
- Algebra and Number Theory
- Analytic and Algebraic Combinatorics
I enjoy utilizing the abstract way of thinking to tackle more concrete problems. For instance,
- Complexity of Counting Problems
- Structural properties of Graph Families
- Privacy & Security in real world database applications
- Random Graphs and Networks
- Evolutionary Algorithms.
Miscellaneous
Fun Facts
The golden ratio is not always nice to have. The clock-scheme for the visualization of continuous fractions due to L.R. Ford gives for the golden ratio the result you can find on the left hand side. Taking the numbers mod 12 results in a clock, that might prevent you from calling it a day!
Publications
For a list of all my publications, see my dblp-entry.
For a list of all my peer-reviewed publications, see below.
2023
Behrendt, Lukas; Casel, Katrin; Friedrich, Tobias; Lagodzinski, J. A. Gregor; Löser, Alexander; Wilhelm, MarcusFrom symmetry to asymmetry: Generalizing TSP approximations by parametrizationJournal of Computer and System Sciences 2023: 157–170
Becher, Kilian; Lagodzinski, J. A. Gregor; Parra-Arnau, Javier; Strufe, ThorstenAnalysis and Prevention of Averaging Attacks Against Obfuscation ProtocolsApplied Cryptography and Network Security (ACNS), Part I 2023: 451–475
2022
Casel, Katrin; Fischbeck, Philipp; Friedrich, Tobias; Göbel, Andreas; Lagodzinski, J. A. GregorZeros and approximations of Holant polynomials on the complex planeComputational Complexity 2022: 11
Bilò, Davide; Casel, Katrin; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Lagodzinski, J.A. Gregor; Schirneck, Martin; Wietheger, SimonFixed-Parameter Sensitivity OraclesInnovations in Theoretical Computer Science (ITCS) 2022: 23:1–23:18
2021
Göbel, Andreas; Lagodzinski, J. A. Gregor; Seidel, KarenCounting Homomorphisms to Trees Modulo a PrimeACM Transactions on Computation Theory 2021
Behrendt, Lukas; Casel, Katrin; Friedrich, Tobias; Lagodzinski, J. A. Gregor; Löser, Alexander; Wilhelm, MarcusFrom Symmetry to Asymmetry: Generalizing TSP Approximations by ParametrizationFundamentals of Computation Theory (FCT) 2021: 53–66
Lagodzinski, J. A. Gregor; Göbel, Andreas; Casel, Katrin; Friedrich, TobiasOn Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime OrderInternational Colloquium on Automata, Languages and Programming (ICALP) 2021: 91:1–91:15
2020
Kötzing, Timo; Lagodzinski, J. A. Gregor; Lengler, Johannes; Melnichenko, AnnaDestructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programmingTheoretical Computer Science 2020: 96–113
Friedrich, Tobias; Kötzing, Timo; Lagodzinski, J. A. Gregor; Neumann, Frank; Schirneck, MartinAnalysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear ConstraintsTheoretical Computer Science 2020: 3–19
Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rizzo, Manuel; Zahn, ArthurMemetic Genetic Algorithms for Time Series Compression by Piecewise Linear ApproximationInternational Conference on Neural Information Processing (ICONIP) 2020: 592–604
Doerr, Benjamin; Kötzing, Timo; Lagodzinski, J. A. Gregor; Lengler, JohannesThe impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run timeTheoretical Computer Science 2020: 144–168
Becher, Kilian; Lagodzinski, J. A. Gregor; Strufe, ThorstenPrivacy-Preserving Public Verification of Ethical Cobalt SourcingTrust, Security and Privacy in Computing and Communications (TrustCom) 2020: 998–1005
2018
Göbel, Andreas; Lagodzinski, J. A. Gregor; Seidel, KarenCounting Homomorphisms to Trees Modulo a PrimeMathematical Foundations of Computer Science (MFCS) 2018: 49:1–49:13
Bläsius, Thomas; Eube, Jan; Feldtkeller, Thomas; Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rothenberger, Ralf; Severin, Julius; Sommer, Fabian; Trautmann, JustinMemory-restricted Routing With Tiled Map DataSystems, Man, and Cybernetics (SMC) 2018: 3347–3354
Kötzing, Timo; Lagodzinski, J. A. Gregor; Lengler, Johannes; Melnichenko, AnnaDestructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic ProgrammingParallel Problem Solving From Nature (PPSN) 2018: 42–54
2017
Doerr, Benjamin; Kötzing, Timo; Lagodzinski, J. A. Gregor; Lengler, JohannesBounding Bloat in Genetic ProgrammingGenetic and Evolutionary Computation Conference (GECCO) 2017: 921–928
Friedrich, Tobias; Kötzing, Timo; Lagodzinski, J. A. Gregor; Neumann, Frank; Schirneck, MartinAnalysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear ConstraintsFoundations of Genetic Algorithms (FOGA) 2017: 45–54
Activities
Current advisory tasks
-
Past advisory tasks
I have been an advisor for the chairs Project Seminar in 2021 "Fault Tolerant Algorithms"
I have been an advisor for the chairs Master Project in 2019 "Asymmetries in the Travelling Salesman Problem"
I have been a supervisor for the chairs Bachelor Project in 2016/17 "Efficient Shortest Paths on Portable Devices".
Advised Bachelor Theses
- Arthur Zahn - ""Hybrid Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation"; together with Tobias Friedrich and Manuel Rizzo
- Fabian Sommer - "Shortest Paths on a Tile-Divided Map - Changing Node Priorities Based on The Accessibility of Tiles"; together with Tobias Friedrich and Martin S. Krejca
- Thomas Feldtkeller - "Analysis of routing algorithms on tiled map data"; together with Tobias Friedrich and Ralf Rothenberger
- Justin Robert Trautmann - "Cache Replacement of Strategies for Routing Algorithms on Tiled Maps"; together with Tobias Friedrich and Martin S. Krejca
Teaching
As a Lecturer
- Graphentheorie, Winter 2017/18, HPI Potsdam
- Diskrete Strukturen, Winter 2016/17, HPI Potsdam
- Introduction to Quantrum Computing, Summer 2021, HPI Potsdam
As a Teaching Assistant
- Algorithmische Spieltheorie, Summer 2017, HPI Potsdam
- Fault Tolerant Algorithms, Summer 2021, HPI Potsdam
As a Tutor
- Lineare Algebra I, Winter 2011/12, FU Berlin
- Lineare Algebra II, Summer 2012, FU Berlin
- Geometrie, Summer 2013, FU Berlin
- Randomisierte Algorithmen, Summer 2016, HPI Potsdam
- Randomisierte Algorithmen II, Winter 2016/17, HPI Potsdam
- Graphenalgorithmen, Summer 2018, HPI Potsdam
Short CV
Education
June 2008: German high school degree (Abitur) from Schadow Gymnasium Berlin, Germany
Oct. 2008 - Sept. 2012: Undergraduate studies in mathematics at FU Berlin, Germany
Feb. 2013: Bachelor of Science degree in mathematics
Oct. 2012 - Mar. 2016: Graduate studies in mathematics at FU Berlin, Germany
Oct. 2015: Master of Science degree in mathematics
Positions
Aug. 2011 - July 2013: Student Assistant in the ERC Advanced Grant Project SDModels at the chair for Discrete Geometry at FU Berlin, Germany.
Starting 2016: Ph.D. student and researcher at the chair for Algorithm Engineering at HPI Potsdam, Germany
Mar. 2020 - June 2020: Internship at SAP ICN Potsdam, Germany
Feb. 2021 - May 2022: External worker at SAP, Germany