Category:LNCS 1004
From BibNetWiki
Jump to:
navigation
,
search
Lecture Notes in Computer Science, Volume 1004
Articles in category "LNCS 1004"
There are 48 articles in this category.
A
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
A Fast and Space-Economical Algorithm for Length-Limited Coding
A Hard Problem that is Almost Always Easy
A Linear Time Algorithm for Finding Maximal Planar Subgraphs
A Resource Assignment Problem on Graphs
Algorithmic Problems Arising from Genome Informatics
Algorithms and computations: 6th international symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995: proceedings
Algorithms for Finding f-Colorings of Partial k-Trees
An Approximation Algorithm for Alphabet Indexing Problem
An Approximation Algorithm for MAX 3-SAT
C
Competitive Searching in Polygons-Beyond Generalised Streets
Computing in Linear Time a Chord from which a Simple Polygon is Weakly Internally Visible
Computing the Tutte Polynomial of a Graph of Moderate Size
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs
D
Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes
E
Embeddings of Hyper-Rings in Hypercubes
F
Fast Approximate Dictionary Matching
Finding Dense Subgraphs
Finding Smallest Supertrees
Finding the Medial Axis of a Simple Polygon in Linear Time
G
Greedy Approximations of Independent Sets in Low Degree Graphs
H
Heap Construction: Optimal in Both Worst and Average Cases?
I
Illumination with Orthogonal Floodlights
L
Learning of Restricted RNLC Graph Languages
Linear Matching-Time Algorithm for the Directed Graph Isomorphism Problem
Linear-time In-Place Selection in Less than 3n Comparisons
Logspace Verifiers, NC, and NP
M
Matching Nuts and Bolts Faster
More Efficient Parallel Flow Algorithms
N
NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application
No Quadrangulation is Extremely Odd
O
On the Complexity of Testing for Catastrophic Faults
O cont.
Optimal Information Delivery
Orders of Gauss Periods in Finite Fields
P
Practical Logic
S
Scheduling Parallel Tasks with Individual Deadlines
Searching for a Monotone Function by Independent Threshold Queries
Should Amdahl's Law be Repealed?
Some Geometric Lower Bounds
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs
Structure in Average Case Complexity
T
The First Subquadratic Algorithm for Complete Linkage Clustering
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
The Parallel Complexity of Approximating the High Degree Subgraph Problem
Two Arc Disjoint Paths in Eulerian Digraphs
U
Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation
W
Weighted Domination of Cocomparability Graphs
Category
:
LNCS
Views
Category
Discussion
Edit
History
Personal tools
Log in / create account
Navigation
Main Page
Community portal
Current events
Recent changes
Random page
Help
Donations
Search
Toolbox
What links here
Related changes
Upload file
Special pages
Printable version
Permanent link
related