|
|
Conferences in DBLP
- Satoru Miyano
Algorithmic Problems Arising from Genome Informatics (Abstract). [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:1- [Conf]
- Shinichi Shimozono
An Approximation Algorithm for Alphabet Indexing Problem. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:2-11 [Conf]
- Jyrki Katajainen, Alistair Moffat, Andrew Turpin
A Fast and Space - Economical Algorithm for Length - Limited Coding. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:12-21 [Conf]
- Binay K. Bhattacharya, Asish Mukhopadhyay
Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:22-31 [Conf]
- Amitava Datta, Christoph A. Hipke, Sven Schuierer
Competitive Searching in Polygons - Beyond Generalised Streets. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:32-41 [Conf]
- Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:42-51 [Conf]
- Satyanarayana V. Lokam, Meena Mahajan, V. Vinay
Logspace Verifiers, NC, and NP. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:52-61 [Conf]
- Christoph Karg, Rainer Schuler
Structure in Average Case Complexity. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:62-71 [Conf]
- Hank Chien, William L. Steiger
Some Geometric Lower Bounds. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:72-81 [Conf]
- Lars Arge
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:82-91 [Conf]
- András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
Two Arc Disjoint Paths in Eulerian Diagraphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:92-101 [Conf]
- Yuichi Asahiro, Kazuo Iwama
Finding Dense Subgraphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:102-111 [Conf]
- Arvind Gupta, Naomi Nishimura
finding Smallest Supertrees. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:112-121 [Conf]
- Maw-Shang Chang
Weighted Domination on Cocomparability Graphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:122-131 [Conf]
- Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
The Parallel Complexity of Approximating the High Degree Subgraph Problem. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:132-141 [Conf]
- Vineet Bafna, Piotr Berman, Toshihiro Fujito
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:142-151 [Conf]
- Magnús M. Halldórsson, Kiyohito Yoshihara
Greedy Approximations of Independent Sets in Low Degree Graphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:152-161 [Conf]
- John N. Crossley
Practical Logic (Abstract). [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:162- [Conf]
- Takao Ono, Tomio Hirata, Takao Asano
An Approximation Algorithm for MAX 3-SAT. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:163-170 [Conf]
- Sei'ichi Tani, Koichi Yamazaki
Learning of Restricted RNLC Graph Languages. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:171-180 [Conf]
- Christos H. Papadimitriou, Srinivas Ramanathan, P. Venkat Rangan
Optimal Information Delivery. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:181-187 [Conf]
- Nicola Santoro, J. Ren, Amiya Nayak
On the Complexity of Testing for Catastrophic Faults. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:188-197 [Conf]
- Oh-Heum Kwon, Kyung-Yong Chwa
Scheduling Parallel Tasks with Individual Deadlines. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:198-207 [Conf]
- Joachim von zur Gathen, Igor Shparlinski
Orders of Gauss Periods in Finite Fields. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:208-215 [Conf]
- George Havas, Bohdan S. Majewski
A Hard Problem That is Almost Always Easy. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:216-223 [Conf]
- Kyoko Sekine, Hiroshi Imai, Seiichiro Tani
Computing the Tutte Polynomial of a Graph of Moderate Size. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:224-233 [Conf]
- Jürgen Dedorath, Jordan Gergov, Torben Hagerup
More Efficient Parallel Flow Algorithms. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:234-243 [Conf]
- Svante Carlsson, Mikael Sundström
Linear-time In-place Selection in Less than 3n Comparisons. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:244-253 [Conf]
- Svante Carlsson, Jingsen Chen
Heap Construction: Optimal in Both Worst and Average Cases? [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:254-263 [Conf]
- Fei Shi
Fast Approximate Dictionary Matching. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:264-273 [Conf]
- Tsan-sheng Hsu
Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:274-283 [Conf]
- Peter Damaschke
Searching for a Monotone Function by Independent Threshold Queries. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:284-290 [Conf]
- Kazuhisa Makino, Toshihide Ibaraki
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:291-300 [Conf]
- Hsu-Chun Yen, Shi-Tsuen Jian, Ta-Pang Lao
Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:301-310 [Conf]
- Franco P. Preparata
Should Amdahl's Law Be Repealed? (Abstract). [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:311- [Conf]
- Yukihiro Hamada, Aohan Mei, Yasuaki Nishitani, Yoshihide Igarashi
Embeddings of Hyper-Rings in Hypercubes. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:312-321 [Conf]
- Siu-Wing Cheng, Chi-Keung Tang
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:322-331 [Conf]
- Xiao Zhou, Takao Nishizeki
Algorithms for Finding f-Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:332-341 [Conf]
- Cho Hwan-Gue, Alexander Zelikovsky
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:342-351 [Conf]
- Wen-Lian Hsu
A Linear Time Algorithm For Finding Maximal Planar Subgraphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:352-361 [Conf]
- James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia
Illumination with Orthogonal Floodlights. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:362-371 [Conf]
- Prosenjit Bose, Godfried T. Toussaint
No Quadrangulation is Extremely Odd. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:372-381 [Conf]
- Francis Y. L. Chin, Jack Snoeyink, Cao An Wang
Finding the Medial Axis of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:382-391 [Conf]
- Drago Krznaric, Christos Levcopoulos
The First Subquadratic Algorithm for Complete Linkage Clustering. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:392-401 [Conf]
- Phillip G. Bradford, Rudolf Fleischer
Matching Nuts and Bolts Faster. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:402-408 [Conf]
- James Jianghai Fu
Linear matching-time algorithm for the directed graph isomorphism problem. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:409-417 [Conf]
- Satoshi Fujita, Tiko Kameda, Masafumi Yamashita
A Resource Assignment Problem on Graphs. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:418-427 [Conf]
- Zhi-Zhong Chen
NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:428-437 [Conf]
|
