Andrzej Proskurowski

Citata da

	Tutte	Dal 2019
Citazioni	6450	1099
Indice H	36	14
i10-index	67	20

240

120

180

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202440 14 51 61 68 104 100 123 129 144 103 107 125 132 127 137 143 153 176 163 212 225 222 219 228 181 205 216 236 224 191 219 202 184 153 164 196 180 207 199

Accesso pubblico

Visualizza tutto

4 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Jan Arne TelleUniversity of Bergen, NorwayEmail verificata su ii.uib.no
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaEmail verificata su kam.mff.cuni.cz
Stephen T. HedetniemiProfessor Emeritus, School of Computing, Clemson UniversityEmail verificata su clemson.edu
Maciej M. SysłoWarsow School of Computer Science, WarsawEmail verificata su ii.uni.wroc.pl
Frank RuskeyComputer Science, University of VictoriaEmail verificata su cs.uvic.ca
Jiri FialaCharles UniversityEmail verificata su kam.mff.cuni.cz
Bruno CourcelleProfesseur émérite , Bordeaux, InformatiqueEmail verificata su labri.fr
Sandra Mitchell Hedetniemi, Sandra L...Professor of Computer Science, Clemson UniversityEmail verificata su cs.clemson.edu
Pinar HeggernesProfessor of computer science, University of BergenEmail verificata su ii.uib.no
Daniel KralMasaryk UniversityEmail verificata su fi.muni.cz
Magnús M. HalldórssonProfessor of Computer Science, Reykjavik UniversityEmail verificata su ru.is
Guy KortsarzProfessor computer scienceEmail verificata su camden.rutgers.edu
Naomi NishimuraUniversity of WaterlooEmail verificata su uwaterloo.ca
Daniel ZappalaProfessor of Computer Science, Brigham young UniversityEmail verificata su cs.byu.edu
Joost Engelfrietassociate professor, LIACS, Leiden UniversityEmail verificata su liacs.leidenuniv.nl
Tero HarjuMatematiikan professori, Turun yliopistoEmail verificata su utu.fi
Grzegorz RozenbergProfessor of Computer Science, Leiden UniversityEmail verificata su liacs.leidenuniv.nl
Hajo BroersmaFaculty EEMCS, University of Twente, NLEmail verificata su utwente.nl
Petr GolovachUniversity of BergenEmail verificata su ii.uib.no
Daniel PaulusmaDepartment of Computer Science, Durham UniversityEmail verificata su durham.ac.uk

Segui

Andrzej Proskurowski

Professor of Computer Science, University of Oregon

Email verificata su cs.uoregon.edu

graph theory algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Complexity of finding embeddings in a k-tree S Arnborg, DG Corneil, A Proskurowski SIAM Journal on Algebraic Discrete Methods 8 (2), 277-284, 1987	1927	1987
Linear time algorithms for NP-hard problems restricted to partial k-trees S Arnborg, A Proskurowski Discrete Applied Mathematics 23 (1), 11-24, 1989	813	1989
Algorithms for vertex partitioning problems on partial k-trees JA Telle, A Proskurowski SIAM Journal on Discrete Mathematics 10 (4), 529-550, 1997	411	1997
Characterization and recognition of partial 3-trees S Arnborg, A Proskurowski SIAM Journal on Algebraic Discrete Methods 7 (2), 305-314, 1986	257	1986
An algebraic theory of graph reduction S Arnborg, B Courcelle, A Proskurowski, D Seese Journal of the ACM (JACM) 40 (5), 1134-1164, 1993	249	1993
Minimum broadcast graphs. AM Farley, ST Hedetniemi, SM Mitchell, A Proskurowski Discret. Math. 25 (2), 189-193, 1979	176	1979
Forbidden minors characterization of partial 3-trees S Arnborg, A Proskurowski, DG Corneil Discrete Mathematics 80 (1), 1-19, 1990	173	1990
Generating binary trees by transpositions F Ruskey, A Proskurowski Journal of algorithms 11 (1), 68-84, 1990	97	1990
Practical algorithms on partial k-trees with an application to domination-like problems JA Telle, A Proskurowski Workshop on Algorithms and Data Structures, 610-621, 1993	95	1993
Minimum broadcast trees Proskurowski IEEE transactions on computers 100 (5), 363-366, 1981	90	1981
On the generation of binary trees A Proskurowski Journal of the ACM (JACM) 27 (1), 1-2, 1980	83	1980
Separating subgraphs in k-trees: Cables and caterpillars A Proskurowski Discrete Mathematics 49 (3), 275-285, 1984	80	1984
Covering regular graphs J Kratochvıl, A Proskurowski, JA Telle Journal of Combinatorial Theory, Series B 71 (1), 1-16, 1997	72	1997
Binary tree Gray codes A Proskurowski, F Ruskey Journal of Algorithms 6 (2), 225-238, 1985	72	1985
Systems of distant representatives J Fiala, J Kratochvíl, A Proskurowski Discrete Applied Mathematics 145 (2), 306-316, 2005	63	2005
Computation of the center and diameter of outerplanar graphs AM Farley, A Proskurowski Discrete Applied Mathematics 2 (3), 185-191, 1980	60	1980
Complexity of graph covering problems J Kratochv, A Proskurowski, J Telle Nordic Journal of Computing 5, 173-195, 1998	58	1998
Gossiping in grid graphs AM Farley, A Proskurowski J. Combin. Inform. System Sci 5, 161-172, 1980	57	1980
Independent domination in trees T Beyer, A Proskurowski, S Hedetniemi, S Mitchell Congr. Numer 19 (321-328), 3.3, 1977	56	1977
Centers of maximal outerplanar graphs A Proskurowski Journal of Graph Theory 4 (1), 75-79, 1980	55	1980

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori