Malgorzata Sulkowska

Orcid: 0000-0001-7745-2951

According to our database1, Malgorzata Sulkowska authored at least 19 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Modularity of minor-free graphs.
J. Graph Theory, April, 2023

Preferential Attachment Hypergraph with Vertex Deactivation.
Proceedings of the 31st International Symposium on Modeling, 2023

2022
Preferential attachment hypergraph with high modularity.
Netw. Sci., December, 2022

Maximizing the expected number of components in an online search of a graph.
Discret. Math., 2022

Counting Embeddings of Rooted Trees into Families of Rooted Trees.
Electron. J. Comb., 2022

An optimal algorithm for stopping on the element closest to the center of an interval.
Adv. Appl. Math., 2022

2020
Uniform random posets.
Inf. Sci., 2020

What Our Choices Say About Our Preferences?
CoRR, 2020

Stronger trust and privacy in social networks via local cooperation1.
J. Complex Networks, 2020

2019
Universal Encoding for Provably Irreversible Data Erasing.
Proceedings of the 16th International Joint Conference on e-Business and Telecommunications, 2019

2017
Percolation and best-choice problem for powers of paths.
J. Appl. Probab., 2017

How to Cooperate Locally to Improve Global Privacy in Social Networks? On Amplification of Privacy Preserving Data Aggregation.
Proceedings of the 2017 IEEE Trustcom/BigDataSE/ICESS, Sydney, Australia, August 1-4, 2017, 2017

2016
Energy-optimal algorithms for computing aggregative functions in random networks.
Discret. Math. Theor. Comput. Sci., 2016

Ghost Train for Anonymous Communication.
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2016

2015
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path.
SIAM J. Discret. Math., 2015

Hierarchical Ring Signatures Revisited - Unconditionally and Perfectly Anonymous Schnorr Version.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2015

2012
The best choice problem for upward directed graphs.
Discret. Optim., 2012

2010
Gusein-Zade problem for directed path.
Discret. Optim., 2010

Practical Universal Random Sampling.
Proceedings of the Advances in Information and Computer Security, 2010


  Loading...