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="Proskurowski, Andrzej"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Extremal graphs having no matching cuts
Paul Bonsma
,
Arthur M. Farley
,
Andrzej Proskurowski
Journal of Graph Theory
69
(2), 2012, pp. 206-222
A generic approach to decomposition algorithms, with an application to digraph decomposition
Binh-Minh Bui-Xuan
,
Pinar Heggernes
,
Daniel Meister
,
Andrzej Proskurowski
Lecture Notes in Computer Science
6842
, 2011, pp. 331-342
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
Pinar Heggernes
,
Daniel Meister
,
Andrzej Proskurowski
Theoretical Computer Science
412
(12-14), 2011, pp. 1275-1297
Minimum distortion embeddings into a path of bipartite permutation and threshold graphs
Pinar Heggernes
,
Daniel Meister
,
Andrzej Proskurowski
Lecture Notes in Computer Science
5124
, 2008, pp. 331-342
Generation of graphs with bounded branchwidth
Christophe Paul
,
Andrzej Proskurowski
,
Jan Arne Telle
Lecture Notes in Computer Science
4271
, 2006, pp. 205-216
On routing of wavebands for all-to-all communications in all-optical paths and cycles
Michele Flammini
,
Alfredo Navarra
,
Andrzej Proskurowski
Theoretical Computer Science
333
(3), 2005, pp. 401-413
Multicoloring trees
Magnús M. Halldórsson
,
Guy Kortsarz
,
Andrzej Proskurowski
,
Ravit Salman
,
Hadas Shachnai
,
Jan Arne Telle
Information and Computation
180
(2), 2003, pp. 113-129
Geometric systems of disjoint representatives
Jiȓí Fiala
,
Jan Kratochvíl
,
Andrzej Proskurowski
Lecture Notes in Computer Science
2528
, 2002, pp. 110-117
Maximum packing for
k
-connected partial
k
-trees in polynomial time
Anders Dessmark
,
Andrzej Lingas
,
Andrzej Proskurowski
Theoretical Computer Science
236
(1-2), 2000, pp. 179-191
Embeddings of
k
-connected graphs of pathwidth
k
Arvind Gupta
,
Naomi Nishimura
,
Andrzej Proskurowski
,
Prabhakar Ragde
Lecture Notes in Computer Science
1851
, 2000, pp. 111-124
Coloring mixed hypertrees
Daniel Král
,
Jan Kratochvíl
,
Andrzej Proskurowski
,
Heinz-Jürgen Voss
Lecture Notes in Computer Science
1928
, 2000, pp. 279-289
Hamiltonicity of amalgams
Arthur M. Farley Farley
,
Andrzej Proskurowski
,
Mirosƚaw Skowronńska
,
Maciej M. Sysƚo
Graphs and Combinatorics
15
(4), 1999, pp. 393-404
Multi-coloring trees
Magnús M. Halldórsson
,
Guy Kortsarz
,
Andrzej Proskurowski
,
Rabit Salman
,
Hadas Shachnai
,
Jan Arne Telle
Lecture Notes in Computer Science
1627
, 1999, pp. 271-280
Memory requirements for table computations in partial
k
-tree algorithms
Bengt Aspvall
,
Andrzej Proskurowski
,
Jan Arne Telle
Lecture Notes in Computer Science
1432
, 1998, pp. 222-233
Minimum-time multidrop broadcast
Arthur M. Farley
,
Andrzej Pelc
,
Andrzej Proskurowski
Discrete Applied Mathematics
83
(1-3), 1998, pp. 61-77
Analysis of algorithms for listing equivalence classes of
k
-ary strings
Andrzej Proskurowski
,
Frank Ruskey
,
Malcolm Smith
SIAM Journal on Discrete Mathematics
11
(1), 1998, pp. 94-109
Minimum self-repairing graphs
Arthur M. Farley
,
Andrzej Proskurowski
Graphs and Combinatorics
13
, 1997, pp. 345-351
Covering regular graphs
Jan Kratochvíl
,
Andrzej Proskurowski
,
Jan Arne Telle
Journal of Combinatorial Theory Series B
71
(1), 1997, pp. 1-16
Complexity of colored graph covers I. Colored directed multigraphs
Jan Kratochvíl
,
Andrzej Proskurowski
,
Jan Arne Telle
Lecture Notes in Computer Science
1335
, 1997, pp. 242-257
Algorithms for vertex partitioning problems on partial
k
-trees
Jan Arne Telle
,
Andrzej Proskurowski
SIAM Journal on Discrete Mathematics
10
(4), 1997, pp. 529-550
A generalization of line graphs:
(X,Y)
-intersection graphs
Leizhen Cai
,
Derek Corneil
,
Andrzej Proskurowski
Journal of Graph Theory
21
(3), 1996, pp. 267-287
Faster algorithms for subgraph isomorphism of
\kappa
-connected partial
\kappa
-trees
Anders Dessmark
,
Andrzej Lingas
,
Andrzej Proskurowski
Lecture Notes in Computer Science
1136
, 1996, pp. 501-513
Complexity of graph covering problems
Jan Kratochvíl
,
Andrzej Proskurowski
,
Jan Arne Telle
Lecture Notes in Computer Science
903
, 1995, pp. 93-105
Bounded-call broadcasting
Arthur M. Farley
,
Andrzej Proskurowski
Discrete Applied Mathematics
53
, 1994, pp. 37-53
An algebraic theory of graph reduction
Stefan Arnborg
,
Bruno Courcelle
,
Andrzej Proskurowski
,
Detlef Seese
Journal of the ACM
40
(5), 1993, November, pp. 1134-1164
Seiten 1
2
>