Write in a clean editor, then format for International Journal of Foundations of Computer Science in one click — DocuGuru applies the official World Scientific template with superscript references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
International Journal of Foundations of Computer Science is a peer-reviewed journal published by World Scientific, covering semigroups and automata theory, DNA and Biological Computing, Algorithms and Data Compression.
| Publisher | World Scientific |
|---|---|
| Reference style | Superscript numbered (World Scientific) Superscript — small raised numerals in the text 1. Smith, A., Jones, B. & Lee, C. A representative article title. International Journal of Foundations of Computer Science 12, 45–58 (2023).
Formats any DOI in the closest standard style — International Journal of Foundations of Computer Science has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | semigroups and automata theory DNA and Biological Computing Algorithms and Data Compression Interconnection Networks and Systems Formal Methods in Verification |
| ISSN | 0129-0541 |
| Citation impact (2-yr) | 0.28 |
| h-index | 57 |
| i10-index | 546 |
| Total citations | 20,139 |
| Top institutions publishing here | Centre National de la Recherche Scientifique |
| Journal website | www.cs.ucsb.edu |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. This naturally engenders new route-discovery problems under changing conditions over these networks. Unfortunately, the temporal variations in the network topology are hard to be effectively captured in a classical graph model.…
Graphs of clique–width at most k were introduced by Courcelle, Engelfriet and Rozenberg (1993) as graphs which can be defined by k-expressions based on graph operations which use k vertex labels. In this paper we study the clique–width of perfect graph classes. On one hand, we show that every distance–hereditary graph, has clique–width at most…
Live sequence charts (LSCs) have been defined recently as an extension of message sequence charts (MSCs; or their UML variant, sequence charts (MSCs; or their UML variant, sequence diagrams) for rich inter-object specification. One of the main additions is the notion of universal charts and hot, mandatory behavior, which, among other things, enables one to…
In this paper we consider the following game: players must alternately color the lowest numbered uncolored vertex of a given graph G= ({1, 2,…, n}, E) with a color, taken from a given set C, such that two adjacent vertices are never colored with the same color. In one variant, the first player which is…
The shortest path problem is a classical network problem that has been extensively studied. The problem of determining not only the shortest path, but also listing the K shortest paths (for a given integer K>1) is also a classical one but has not been studied so intensively, despite its obvious practical interest. Two different types…
