Search
Subscription
Submission Procedure
Login
User: anonymous
Special Issues
Volume 14 (2008)
Volume 13 (2007)
Volume 12 (2006)
Volume 11 (2005)
Volume 10 (2004)
Volume 9 (2003)
Volume 8 (2002)
Volume 7 (2001)
Volume 6 (2000)
Volume 5 (1999)
Volume 4 (1998)
Volume 3 (1997)
Volume 2 (1996)
Volume 1 (1995)
Volume 0 (1994)
Articles by Topics
Articles by Author
Board of Editors
List of Topics
What's New
Aims and Scope
Submission Procedure
Subscription
Printed Publications
Collection of other papers
Articles by Topics
Topic G. - Mathematics of Computing
Topic G.2 - DISCRETE MATHEMATICS
Topic G.2.2 - Graph Theory
J. Abello, A. J. Pogel, L. Miller
:
Breadth First Search Graph Partitions and Concept Lattices
/jucs_10_8/breadth_first_search_graph
page 934 - 954
Vol.10
/
Issue 8
R. F. M. Aranha, C.P. Rangan
:
An Efficient Distributed Algorithm For st-numbering the Vertices of a Biconnected Graph
/jucs_1_9/an_efficient_distributed_algorithm
page 633 - 650
Vol.1
/
Issue 9
A. Bagheri, M. Razzazi
:
How to Draw Free Trees Inside Bounded Simple Polygons
/jucs_11_6/how_to_draw_free
page 804 - 829
Vol.11
/
Issue 6
A.T. Balaban, M. Randić
:
Perfect Matchings in Polyhexes, or Recent Graph-theoretical Contributions to Benzenoids
/jucs_13_11/perfect_matchings_in_polyhexes
page 1514 - 1539
Vol.13
/
Issue 11
R. Berghammer, T. Hoffmann
:
Modeling Sequences within the RelView System
/jucs_7_2/modeling_sequences_within_the
page 107 - 123
Vol.7
/
Issue 2
P. Chaudhuri, H. Thompson
:
A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling
/jucs_10_2/a_message_optimal_distributed
page 106 - 119
Vol.10
/
Issue 2
A. Cordón-Franco, F. Sancho-Caparrini
:
A Note on Complexity Measures for Probabilistic P Systems
/jucs_10_5/a_note_on_complexity
page 559 - 566
Vol.10
/
Issue 5
A. Dumitrescu, C.D. Tóth
:
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
/jucs_13_11/analysis_of_two_sweep
page 1615 - 1627
Vol.13
/
Issue 11
S. Hanke, T. Ottmann, S. Schuierer
:
The Edge-Flipping Distance of Triangulations
/jucs_2_8/the_edge_flipping_distance
page 570 - 579
Vol.2
/
Issue 8
D. Won-Kyu Hong, C. Seon Hong, Y. Jae Hyoung, D.-S. Yun, W.-S. Kim
:
Bounded Flooding Routing Algorithm for Provisioning the Globally Optimal Route in a Hierarchical ATM Network
/jucs_8_7/bounded_flooding_routing_algorithm
page 698 - 721
Vol.8
/
Issue 7
A. Lee, I. Streinu, L. Theran
:
Graded Sparse Graphs and Matroids
/jucs_13_11/graded_sparse_graphs_and
page 1671 - 1679
Vol.13
/
Issue 11
V.E. Levit, E. Mandrescu
:
Matrices and α-Stable Bipartite Graphs
/jucs_13_11/matrices_and_alpha_stable
page 1692 - 1706
Vol.13
/
Issue 11
D.-R. Popescu
:
Balance in Systems of Finite Sets with Applications
/jucs_13_11/balance_in_systems_of
page 1755 - 1766
Vol.13
/
Issue 11
G. Păun
:
Spiking Neural P Systems with Astrocyte-Like Control
/jucs_13_11/spiking_neural_p_systems
page 1707 - 1721
Vol.13
/
Issue 11
K. Strötmann
:
The Constrained Shortest Path Problem: A Case Study in Using ASMs
/jucs_3_4/shortest_path_problem
page 304 - 319
Vol.3
/
Issue 4
M. Tătărâm
:
Connectivity and Reachability in Signed Networks
/jucs_13_11/connectivity_and_reachability_in
page 1779 - 1790
Vol.13
/
Issue 11
K. Xue, M. Zimand
:
Extractors for the Real World
/jucs_6_1/extractors_for_the_real
page 212 - 225
Vol.6
/
Issue 1
C. Zamfirescu, T. Zamfirescu
:
Hamiltonicity of Topological Grid Graphs
/jucs_13_11/hamiltonicity_of_topological_grid
page 1791 - 1800
Vol.13
/
Issue 11
Editors:
Dumitrescu Adrian
Krumke Sven O.
Pantziou Grammati E.
Ponzoni Ignacio
Rangan C. Pandu
Szwarcfiter Jayme Luiz
Tabakow Iwan Georgiew
Widmayer Peter