0.6(top 50%)
impact factor
1.8K(top 10%)
papers
15.2K(top 10%)
citations
46(top 20%)
h-index
0.7(top 50%)
impact factor
2.0K
all documents
16.0K
doc citations
67(top 20%)
g-index
Top Articles
| # | Title | Journal | Year | Citations |
|---|---|---|---|---|
| 1 | COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS | International Journal of Foundations of Computer Science | 2003 | 236 |
| 2 | ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES | International Journal of Foundations of Computer Science | 2000 | 171 |
| 3 | Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems | International Journal of Foundations of Computer Science | 2003 | 146 |
| 4 | NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES | International Journal of Foundations of Computer Science | 2003 | 134 |
| 5 | SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS | International Journal of Foundations of Computer Science | 2002 | 130 |
| 6 | ON THE COMPLEXITY OF SOME COLORING GAMES | International Journal of Foundations of Computer Science | 1991 | 127 |
| 7 | SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS | International Journal of Foundations of Computer Science | 2006 | 117 |
| 8 | DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS | International Journal of Foundations of Computer Science | 1999 | 115 |
| 9 | UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION | International Journal of Foundations of Computer Science | 2002 | 110 |
| 10 | A TOUR OF REACTION SYSTEMS | International Journal of Foundations of Computer Science | 2011 | 94 |
| 11 | PETRI NETS AND STEP TRANSITION SYSTEMS | International Journal of Foundations of Computer Science | 1992 | 93 |
| 12 | THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS | International Journal of Foundations of Computer Science | 2002 | 80 |
| 13 | EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS | International Journal of Foundations of Computer Science | 2003 | 80 |
| 14 | DYNAMICAL PROBABILISTIC P SYSTEMS | International Journal of Foundations of Computer Science | 2006 | 79 |
| 15 | ON DISJOINT CYCLES | International Journal of Foundations of Computer Science | 1994 | 78 |
| 16 | REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS | International Journal of Foundations of Computer Science | 2001 | 76 |
| 17 | ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS | International Journal of Foundations of Computer Science | 1996 | 75 |
| 18 | ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS | International Journal of Foundations of Computer Science | 2004 | 72 |
| 19 | EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES | International Journal of Foundations of Computer Science | 2003 | 71 |
| 20 | A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS | International Journal of Foundations of Computer Science | 2003 | 70 |
| 21 | A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS | International Journal of Foundations of Computer Science | 2003 | 69 |
| 22 | MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS | International Journal of Foundations of Computer Science | 1996 | 68 |
| 23 | MONA IMPLEMENTATION SECRETS | International Journal of Foundations of Computer Science | 2002 | 68 |
| 24 | On Reasoning About Rings | International Journal of Foundations of Computer Science | 2003 | 68 |
| 25 | ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S | International Journal of Foundations of Computer Science | 1999 | 67 |
| 26 | GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH | International Journal of Foundations of Computer Science | 2000 | 67 |
| 27 | HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT | International Journal of Foundations of Computer Science | 2002 | 67 |
| 28 | THE DELAUNAY HIERARCHY | International Journal of Foundations of Computer Science | 2002 | 65 |
| 29 | JUMPING FINITE AUTOMATA | International Journal of Foundations of Computer Science | 2012 | 64 |
| 30 | APPLICATION PLACEMENT ON A CLUSTER OF SERVERS | International Journal of Foundations of Computer Science | 2007 | 62 |
| 31 | AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA | International Journal of Foundations of Computer Science | 2009 | 62 |
| 32 | MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS | International Journal of Foundations of Computer Science | 2003 | 61 |
| 33 | FUNCTIONS DEFINED BY REACTION SYSTEMS | International Journal of Foundations of Computer Science | 2011 | 60 |
| 34 | ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS | International Journal of Foundations of Computer Science | 2005 | 58 |
| 35 | STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION | International Journal of Foundations of Computer Science | 2005 | 58 |
| 36 | #P-COMPLETENESS VIA MANY-ONE REDUCTIONS | International Journal of Foundations of Computer Science | 1991 | 57 |
| 37 | PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT | International Journal of Foundations of Computer Science | 1999 | 55 |
| 38 | ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES | International Journal of Foundations of Computer Science | 2012 | 53 |
| 39 | AUTOMATIC SERVICE COMPOSITION VIA SIMULATION | International Journal of Foundations of Computer Science | 2008 | 52 |
| 40 | ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS | International Journal of Foundations of Computer Science | 2012 | 51 |
| 41 | SOLVING SYMBOLIC ORDERING CONSTRAINTS | International Journal of Foundations of Computer Science | 1990 | 50 |
| 42 | AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH | International Journal of Foundations of Computer Science | 2000 | 50 |
| 43 | COMPUTING WITH MEMBRANES (P SYSTEMS): A VARIANT | International Journal of Foundations of Computer Science | 2000 | 50 |
| 44 | APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS | International Journal of Foundations of Computer Science | 2002 | 50 |
| 45 | WALKING IN A TRIANGULATION | International Journal of Foundations of Computer Science | 2002 | 50 |
| 46 | DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY | International Journal of Foundations of Computer Science | 2005 | 50 |
| 47 | A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS | International Journal of Foundations of Computer Science | 2008 | 50 |
| 48 | COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS | International Journal of Foundations of Computer Science | 2010 | 49 |
| 49 | ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS | International Journal of Foundations of Computer Science | 2008 | 48 |
| 50 | MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS | International Journal of Foundations of Computer Science | 2008 | 48 |