Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Szyma{\'n}ska, Edyta"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate counting of matchings in (3,3)-hypergraphs
Andrzej Dudek
,
Marek Karpinski
,
Andrzej Ruciński
,
Edyta Szymańska
Lecture Notes in Computer Science
8503
, 2014, pp. 380-391
H
-colorings of dense hypergraphs
Edyta Szymańska
Information Processing Letters
112
(23), 2012, pp. 899-902
Computational complexity of the perfect matching problem in hypergraphs with subcritical density
Marek Karpiński
,
Andrzej Ruciński
,
Edyta Szymańska
International Journal of Foundations of Computer Science
21
(6), 2010, pp. 905-924
Computational complexity of the Hamiltonian cycle problem in dense hypergraphs
Marek Karpiński
,
Andrzej Ruciński
,
Edyta Szymańska
Lecture Notes in Computer Science
6034
, 2010, pp. 662-673
The complexity of vertex coloring problems in uniform hypergraphs with high degree
Edyta Szymańska
Lecture Notes in Computer Science
6410
, 2010, pp. 304-314
Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs
Andrzej Czygrinow
,
Michaƚ Hańćkowiak
,
Edyta Szymańska
Lecture Notes in Computer Science
5878
, 2009, pp. 668-678
The complexity of perfect matching problems on dense hypergraphs
Marek Karpiński
,
Andrzej Ruciński
,
Edyta Szymańska
Lecture Notes in Computer Science
5878
, 2009, pp. 626-636
Distributed approximation algorithms for planar graphs
Andrzej Czygrinow
,
Michaƚ Hańćkowiak
,
Edyta Szymańska
Lecture Notes in Computer Science
3998
, 2006, pp. 296-307
A fast distributed algorithm for approximating the maximum matching
Andrzej Czygrinow
,
Michaƚ Hańćkowiak
,
Edyta Szymańska
Lecture Notes in Computer Science
3221
, 2004, pp. 252-263
Derandomization of a parallel randomized algorithm for finding a maximal independent set in a linear hypergraph
Edyta Szymańska
Proceedings in Informatics
8
, 2000, pp. 39-52
A parallel randomized algorithm for finding a maximal independent set in a linear hypergraph
Tomasz Łuczak
,
Edyta Szymańska
Journal of Algorithms
25
(2), 1997, pp. 311-320