C. Aguirre, R. Huerta, L. Tsimring:
Optimal Serverless Networks Attacks, Complexity and some Approximate Algorithms
/jucs_15_14/optimal_serverless_networks_attacks

page 2747 - 2764
Vol.15 / Issue 14

F. Aurenhammer:
Computational Geometry - Some Easy Questions and their Recent Solutions
/jucs_7_5/computational_geometry_some_easy

page 338 - 354
Vol.7 / Issue 5

H. L. Bodlaender:
A Generic NP-hardness Proof for a Variant of Graph Coloring
/jucs_7_12/a_generic_np_hardness

page 1114 - 1124
Vol.7 / Issue 12

B. Bollig:
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
/jucs_12_6/testing_membership_in_formal

page 710 - 724
Vol.12 / Issue 6

H. Bordihn, M. Holzer:
On the Computational Complexity of Synchronized Context-Free Languages
/jucs_8_2/on_the_computational_complexity

page 119 - 140
Vol.8 / Issue 2

E. Camponogara, R. Boveto Shima:
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
/jucs_16_3/mobile_agent_routing_with

page 372 - 401
Vol.16 / Issue 3

P. Chaudhuri, T. Edward:
An O(√n) Distributed Mutual Exclusion Algorithm Using Queue Migration
/jucs_12_2/an_0_square_root

page 140 - 159
Vol.12 / 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. 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

V. Estivill-Castro, A. Heednacram, F. Suraweera:
NP-completeness and FPT Results for Rectilinear Covering Problems
/jucs_16_5/np_completeness_and_ftp

page 622 - 652
Vol.16 / Issue 5

T.A. Gorazd, J. Krzaczkowski:
Term Satisfiability Problem for Two-Element Algebras is in QL or is NQL-Complete
/jucs_19_10/term_satisfiability_problem_for

page 1375 - 1395
Vol.19 / Issue 10

C. Grozea:
Free-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem
/jucs_6_1/free_extendible_prefix_free

page 130 - 135
Vol.6 / Issue 1

D. J. Haglin, R. W. Ford:
The Message-Minimizing Load Redistribution Problem
/jucs_7_4/the_message_minimizing_load

page 291 - 306
Vol.7 / Issue 4

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

F. He, G. Yang, L. Cheng, X. Song, M. Gu, J. Sun:
On Theoretical Upper Bound for Routing Estimation
/jucs_11_6/on_theoretical_upper_bound

page 916 - 925
Vol.11 / Issue 6

H. Hempel:
Randomized Algorithms and Complexity Theory
/jucs_12_6/randomized_algorithms_and_complexity

page 746 - 761
Vol.12 / Issue 6

J. Keller, C.W. Kessler, R. Hultén:
Optimized On-Chip-Pipelining for Memory-Intensive Computations on Multi-Core Processors with Explicit Memory Hierarchy
/jucs_18_14/optimized_on_chip_pipelining

page 1987 - 2023
Vol.18 / Issue 14

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. Leppaenen:
On Implementing EREW Work-Optimally on Mesh of Trees
/jucs_1_1/on_implementing_erew_work

page 23 - 34
Vol.1 / Issue 1

E. Levner, A. Elalouf, T.E. Cheng:
An Improved FPTAS for Mobile Agent Routing with Time Constraints
/jucs_17_13/an_improved_FPTAS_for

page 1854 - 1862
Vol.17 / Issue 13

R. Dueire Lins:
Lazy Cyclic Reference Counting
/jucs_9_8/lazy_cyclic_reference_counting

page 813 - 828
Vol.9 / Issue 8

M. Margenstern:
About an Algorithmic Approach to Tilings {p,q} of the Hyperbolic Plane
/jucs_12_5/about_an_algorithmic_approach

page 512 - 550
Vol.12 / Issue 5

Q. Niu, T. Zhou, S. Ma:
A Quantum-Inspired Immune Algorithm for Hybrid Flow Shop with Makespan Criterion
/jucs_15_4/a_quantum_inspired_immune

page 765 - 785
Vol.15 / Issue 4

M. Platzner, B. Rinner, R. Weiss:
Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation
/jucs_1_12/exploiting_parallelism_in_constraint

page 811 - 820
Vol.1 / Issue 12

L. Prechelt, G. Malpohl, M. Philippsen:
Finding Plagiarisms among a Set of Programs with JPlag
/jucs_8_11/finding_plagiarisms_among_a

page 1016 - 1038
Vol.8 / Issue 11

T. Riege, J. Rothe:
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
/jucs_12_6/improving_deterministic_and_randomized

page 725 - 745
Vol.12 / Issue 6

T. Riege, J. Rothe:
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey
/jucs_12_5/completenes_in_the_boolean

page 551 - 578
Vol.12 / Issue 5

W. G. Schneeweiss:
Advanced Fault Tree Modeling
/jucs_5_10/advanced_fault_tree_modeling

page 633 - 643
Vol.5 / Issue 10

M. Vujošević-Janičić, J. Tomašević, P. Janičić:
Random k-GD-Sat Model and its Phase Transition
/jucs_13_4/random_k_gd_sat

page 572 - 591
Vol.13 / Issue 4

K. Xue, M. Zimand:
Extractors for the Real World
/jucs_6_1/extractors_for_the_real

page 212 - 225
Vol.6 / Issue 1

T. Zeng, C. Tang, Y. Xiang, P. Chen, Y. Liu:
A Model of Immune Gene Expression Programming for Rule Mining
/jucs_13_10/a_model_of_immune

page 1484 - 1497
Vol.13 / Issue 10