G / 01
Graph algorithms
Online matching, local search and exact worst-case guarantees. I study the quality of decisions made with limited information and under local constraints.
COMPUTER SCIENCE / ALGORITHMS
Marek
Gałązka
PhD in Computer Science · Assistant Professor
Graph algorithms. Random structures. Probabilistic methods.
I study algorithms and growing random trees, combining mathematical proofs with computational experiments.
Adam Mickiewicz University, PoznańDepartment of Algorithm Theory and Data Security
01
Research, code & teaching
I am a computer scientist and assistant professor at Adam Mickiewicz University in Poznań. My research focuses on graph algorithms, random trees and probabilistic analysis. I also pursue separate lines of research in statistical modelling and financial network analysis.
I combine mathematical reasoning, algorithm design and computational experiments. Alongside my academic work, I develop ABAP solutions for SAP SD and teach programming and web technologies.
University profile ↗02
Research directions
Graph algorithms and random structures, alongside separate research in statistical modelling and financial networks.
P / 02
Random trees & probability
Growing recursive trees, attachment rules and path lengths. I analyse how global structure develops and fluctuates as a random tree grows.
S / 03
Statistical models & financial networks
Separate lines of research address variable selection in mixed models and network-based descriptions of financial dependence, using computational methods and empirical data.
Journal articles, a conference contribution and recent research preprints.
2026
Adaptive Re-Screening and Pair-Screened Joint Rescue for Scalable Stepwise Selection in Cross-Classified Linear Mixed Models
Applied Sciences, 16(20), 10010
Adaptive screening and joint evaluation of predictor pairs for efficient variable selection in complex mixed models.
2026
Exact Locality Gaps for Matchable Semi-Matchings
arXiv:2610.01648
Exact worst-case guarantees for local search in task-to-server assignments, with matching extremal constructions on trees.
2026
Total Path Length in Power-Weight Recursive Trees: Martingale Limits and Global Fluctuations
arXiv:2610.00614
Martingale limits and global fluctuations of total path length in weighted recursive trees across different attachment regimes.
2026
Robust and Learned Online Matching in Growing Trees
arXiv:2609.40077
Online matching with misspecified or unknown growth laws, combining robustness guarantees with learning from the evolving tree.
2024
ABAP Unit Testing Performance and Quality Analysis in SAP HANA
Artificial intelligence and Machine Learning · CCIS 2101, 267–279
Technical insights and practical rules for improving the performance and quality of unit testing in ABAP.
2020
Nonuniform recursive trees with vertex attraction depending on their labels
Functiones et Approximatio Commentarii Mathematici · 62(2), 269–278
A family of nonuniform recursive trees in which attachment probabilities depend on vertex labels, with results on vertex degrees.
2012
Security of scale-free networks
Journal of Mathematical Sciences · 182, 200–209
Theoretical and experimental analysis of vertex isolation in scale-free networks under random vertex and edge deletion, using the LCD model.
2011
Characteristics of the Polish Stock Market correlations
International Review of Financial Analysis · 20(1), 1–5
Network descriptions of correlations in the Polish stock market, comparing minimum spanning trees with weighted random graphs.
No matching publications. Try a different phrase or choose “All work”.
04
Teaching & practice
From mathematical ideas to working software.
My teaching covers programming foundations, algorithms and data structures, object-oriented programming and web technologies. I connect core concepts with concrete examples and the design of complete applications.
Programming foundations
Programming fundamentals, object-oriented design and examples in Java, Python and C#.
Algorithms and data structures
Core data structures, searching and sorting, graph algorithms, and analysis of time and space complexity.
Object-oriented programming
Classes and objects, encapsulation, inheritance and polymorphism, with practical examples of application design.
Web technologies
JavaScript, multimedia on the web and the development of modern web applications.
SAP / ABAP
In professional practice, I develop ABAP solutions for SAP SD. My publication on ABAP unit testing connects software quality with the everyday work of implementing and maintaining business systems.
GET IN TOUCH
Discuss a research idea.
For research questions, collaboration or academic enquiries, please contact me by email.
galazka@amu.edu.plAdam Mickiewicz University, PoznańFaculty of Mathematics and Computer ScienceDepartment of Algorithm Theory and Data Security