Follow
Małgorzata Sulkowska
Małgorzata Sulkowska
Wrocław University of Science and Technology (Politechnika Wrocławska)
Verified email at pwr.edu.pl
Title
Cited by
Cited by
Year
Preferential attachment hypergraph with high modularity
F Giroire, N Nisse, T Trolliet, M Sulkowska
Network Science 10 (4), 400-429, 2022
132022
The best choice problem for upward directed graphs
M Sulkowska
Discrete Optimization 9 (3), 200-204, 2012
82012
Modularity of minor‐free graphs
M Lasoń, M Sulkowska
Journal of Graph Theory 102 (4), 728-736, 2023
62023
Protection numbers in simply generated trees and Pólya trees
B Gittenberger, Z Gołębiewski, I Larcher, M Sulkowska
Applicable Analysis and Discrete Mathematics 17 (1), 1-24, 2023
6*2023
Percolation and best-choice problem for powers of paths
FS Benevides, M Sulkowska
Journal of Applied Probability 54 (2), 343-362, 2017
62017
Gusein-Zade problem for directed path
M Przykucki, M Sulkowska
Discrete Optimization 7 (1-2), 13-20, 2010
62010
Hierarchical ring signatures revisited–unconditionally and perfectly anonymous schnorr version
Ł Krzywiecki, M Sulkowska, F Zagórski
Security, Privacy, and Applied Cryptography Engineering: 5th International …, 2015
52015
Practical universal random sampling
M Klonowski, M Przykucki, T Strumiński, M Sulkowska
International Workshop on Security, 84-100, 2010
42010
Counting embeddings of rooted trees into families of rooted trees
B Gittenberger, Z Gołębiewski, I Larcher, M Sulkowska
arXiv preprint arXiv:2008.08312, 2020
32020
Stronger trust and privacy in social networks via local cooperation
K Grining, M Klonowski, M Sulkowska
Journal of Complex Networks 8 (4), cnz032, 2020
32020
How to cooperate locally to improve global privacy in social networks? On amplification of privacy preserving data aggregation
K Grining, M Klonowski, M Sulkowska
2017 IEEE Trustcom/BigDataSE/ICESS, 464-471, 2017
32017
From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
A Grzesik, M Morayne, M Sulkowska
SIAM Journal on Discrete Mathematics 29 (1), 500-513, 2015
32015
An optimal algorithm for stopping on the element closest to the center of an interval
EM Kubicka, G Kubicki, M Kuchta, M Sulkowska
Advances in Applied Mathematics 133, 102281, 2022
22022
Maximizing the expected number of components in an online search of a graph
FS Benevides, M Sulkowska
Discrete Mathematics 345 (1), 112668, 2022
22022
Uniform random posets
P Kozieł, M Sulkowska
Information Sciences 515, 294-301, 2020
22020
Energy-optimal algorithms for computing aggregative functions in random networks
M Klonowski, M Sulkowska
Discrete Mathematics & Theoretical Computer Science 17 (Discrete Algorithms), 2016
22016
Analysis of a simple effective on-line algorithm for the graph theoretic generalization of the best choice problem
P Balister, G Brightwell, M Morayne, M Sulkowska
preprint, 2011
22011
Preferential attachment hypergraph with vertex deactivation
F Giroire, N Nisse, K Ohulchanskyi, M Sulkowska, T Trolliet
arXiv preprint arXiv:2205.00071, 2022
12022
Universal Encoding for Provably Irreversible Data Erasing.
M Klonowski, T Struminski, M Sulkowska
ICETE (2), 137-148, 2019
12019
Preferential attachment hypergraph with vertex deactivation
F Giroire, N Nisse, K Ohulchanskyi, M Sulkowska, T Trolliet
2023 31st International Symposium on Modeling, Analysis, and Simulation of …, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20