Publications of Malgorzata Sulkowska
BACK TO COATI PUBLICATION INDEXPublications of Malgorzata Sulkowska
| Articles in journal or book's chapters |
-
Malgorzata Sulkowska and Fabrìcio Siqueira Benevides.
Maximizing the expected number of components in an online search of a graph.
Discrete Mathematics,
345(1):112668,
January 2022.
[WWW
] [PDF
] [bibtex-entry]
-
Malgorzata Sulkowska,
Ewa Kubicka,
Grzegorz Kubicki,
and Malgorzata Kuchta.
An optimal algorithm for stopping on the element closest to the center of an interval.
Advances in Applied Mathematics,
133:102281,
February 2022.
[WWW
] [PDF
] [bibtex-entry]
-
Malgorzata Sulkowska,
Bernhard Gittenberger,
Zbigniew GolÄbiewski,
and Isabella Larcher.
Protection numbers in simply generated trees and Pólya trees.
Applicable Analysis and Discrete Mathematics,
(00):10-10,
2021.
[WWW
] [PDF
] [bibtex-entry]
| Internal reports |
-
Frédéric Giroire,
Nicolas Nisse,
Thibaud Trolliet,
and Malgorzata Sulkowska.
Preferential attachment hypergraph with high modularity.
Research Report,
Université Cote d'Azur,
2021.
[WWW
] [PDF
]
Keywords: Complex network, Hypergraph, Preferential attachment, Modularity. [bibtex-entry]
-
Malgorzata Sulkowska,
Bernhard Gittenberger,
Zbigniew GolÄbiewski,
and Isabella Larcher.
Counting embeddings of rooted trees into families of rooted trees.
Research Report,
Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology ; Technische Universität Wien,
September 2021.
Note: 20 pages, 6 figures. [WWW ] [PDF ] [bibtex-entry]
-
Malgorzata Sulkowska,
Alexander Gnedin,
and Patryk Koziel.
Running minimum in the best-choice problem.
Research Report,
Wroclaw University of Science and Technology ; University of London, Queen Mary ; Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142),
October 2021.
Note: 22 pages, 9 figures. [WWW ] [PDF ] [bibtex-entry]
-
Malgorzata Sulkowska,
Krzysztof Grining,
and Marek Klonowski.
What Do Our Choices Say About Our Preferences?.
Research Report,
Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology,
June 2021.
Note: 22 pages, 6 figures. [WWW ] [PDF ] [bibtex-entry]
-
Malgorzata Sulkowska and Michal Lason.
Modularity of minor-free graphs.
Research Report,
Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Institute of Mathematics of the Polish Academy of Sciences ; Wroclaw University of Science and Technology,
February 2021.
Note: 7 pages, 1 figure. [WWW ] [PDF ] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:47 2022