| Year |
Citation |
Score |
| 2008 |
Dujmović V, Fellows MR, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond F, Whitesides S, Wood DR. On the parameterized complexity of layered graph drawing Algorithmica (New York). 52: 267-292. DOI: 10.1007/S00453-007-9151-1 |
0.4 |
|
| 2008 |
Fellows MR, Knauer C, Nishimura N, Ragde P, Rosamond F, Stege U, Thilikos DM, Whitesides S. Faster fixed-parameter tractable algorithms for matching and packing problems Algorithmica (New York). 52: 167-176. DOI: 10.1007/S00453-007-9146-Y |
0.471 |
|
| 2007 |
Nishimura N, Ragde P, Szeider S. Solving #SAT using vertex covers Acta Informatica. 44: 509-523. DOI: 10.1007/S00236-007-0056-X |
0.399 |
|
| 2006 |
Dujmović V, Fellows M, Hallett M, Kitching M, Liotta G, Mccartin C, Nishimura N, Ragde P, Rosamond F, Suderman M, Whitesides S, Wood DR. A fixed-parameter approach to 2-layer planarization Algorithmica (New York). 45: 159-182. DOI: 10.1007/s00453-005-1181-y |
0.347 |
|
| 2005 |
Nishimura N, Ragde P, Thilikos DM. Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Discrete Applied Mathematics. 152: 229-245. DOI: 10.1016/J.Dam.2005.02.029 |
0.424 |
|
| 2005 |
Gupta A, Nishimura N, Proskurowski A, Ragde P. Embeddings of k-connected graphs of pathwidth k Discrete Applied Mathematics. 145: 242-265. DOI: 10.1016/J.Dam.2002.12.005 |
0.521 |
|
| 2005 |
Nishimura N, Ragde P, Thilikos DM. Parameterized counting algorithms for general graph covering problems Lecture Notes in Computer Science. 3608: 99-109. |
0.357 |
|
| 2004 |
Demaine ED, Hajiaghayi M, Nishimura N, Ragde P, Thilikos DM. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors Journal of Computer and System Sciences. 69: 166-195. DOI: 10.1016/J.Jcss.2003.12.001 |
0.426 |
|
| 2004 |
Nishimura N, Ragde P, Thilikos DM. Smaller kernels for hitting set problems of constant arity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3162: 121-126. DOI: 10.1007/978-3-540-28639-4_11 |
0.383 |
|
| 2002 |
Nishimura N, Ragde P, Thilikos DM. On Graph Powers for Leaf-Labeled Trees Journal of Algorithms. 42: 69-108. DOI: 10.1006/Jagm.2001.1195 |
0.427 |
|
| 2002 |
Dujmovic V, Fellows M, Hallett M, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond F, Suderman M, Whitesides S, Wood DR. A fixed-parameter approach to two-layer planarization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2265: 1-15. |
0.367 |
|
| 2001 |
Hajiaghayi M, Nishimura N, Ragde P, Thilikos DM. Fast approximation schemes for K3,3-minor-free or K 5-minor-free graphs Electronic Notes in Discrete Mathematics. 10: 137-142. DOI: 10.1016/S1571-0653(04)00379-8 |
0.42 |
|
| 2000 |
Nishimura N, Ragde P, Thilikos DM. Finding smallest supertrees under minor containment International Journal of Foundations of Computer Science. 11: 445-465. DOI: 10.1142/S0129054100000259 |
0.369 |
|
| 1998 |
Berkman O, Matias Y, Ragde P. Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains Journal of Algorithms. 28: 197-215. DOI: 10.1006/Jagm.1997.0905 |
0.455 |
|
| 1998 |
Hagerup T, Katajainen J, Nishimura N, Ragde P. Characterizing multiterminal flow networks and computing flows in networks of small treewidth Journal of Computer and System Sciences. 57: 366-375. |
0.341 |
|
| 1996 |
Dymond PW, Fich FE, Nishimura N, Ragde P, Ruzzo WL. Pointers versus arithmetic in PRAMs Journal of Computer and System Sciences. 53: 218-232. DOI: 10.1006/Jcss.1996.0063 |
0.457 |
|
| 1996 |
Buss JF, Kanellakis PC, Ragde PL, Shvartsman AA. Parallel Algorithms with Processor Failures and Delays Journal of Algorithms. 20: 45-86. DOI: 10.1006/Jagm.1996.0003 |
0.33 |
|
| 1995 |
Fich F, Kowaluk M, Kutyłowski M, Loryś K, Ragde P. Retrieval of scattered information by EREW, CREW, and CRCW PRAMs Computational Complexity. 5: 113-131. DOI: 10.1007/Bf01268141 |
0.436 |
|
| 1993 |
Ragde P. The Parallel Simplicity of Compaction and Chaining Journal of Algorithms. 14: 371-380. DOI: 10.1006/Jagm.1993.1019 |
0.445 |
|
| 1992 |
Ragde P. Processor-time tradeoffs in PRAM simulations Journal of Computer and System Sciences. 44: 103-113. DOI: 10.1016/0022-0000(92)90006-5 |
0.33 |
|
| 1991 |
Ragde P, Wigderson A. Linear-size constant-depth polylog-threshold circuits Information Processing Letters. 39: 143-146. DOI: 10.1016/0020-0190(91)90110-4 |
0.322 |
|
| 1991 |
Ragde P. Analysis of an asynchronous PRAM algorithm Information Processing Letters. 39: 253-256. DOI: 10.1016/0020-0190(91)90024-C |
0.398 |
|
| 1990 |
Grolmusz V, Ragde P. Incomparability in parallel computation Discrete Applied Mathematics. 29: 63-78. DOI: 10.1016/0166-218X(90)90082-N |
0.434 |
|
| 1989 |
Luby M, Ragde P. A bidirectional shortest-path algorithm with good average-case behavior Algorithmica. 4: 551-567. DOI: 10.1007/Bf01553908 |
0.441 |
|
| 1988 |
Fich FE, Ragde P, Wigderson A. Relations between concurrent-write models of parallel computation Siam Journal On Computing. 17: 606-627. DOI: 10.1137/0217037 |
0.333 |
|
| 1988 |
Fich FE, Ragde P, Wigderson A. Simulations among concurrent-write PRAMs Algorithmica. 3: 43-51. DOI: 10.1007/Bf01762109 |
0.414 |
|
| Show low-probability matches. |