Journals in DBLP
Klaus Simon A Note on Lexicographic Breadt First Search for Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:249-251 [Journal ] Derek G. Corneil , Stephan Olariu , Lorna Stewart A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:253-257 [Journal ] Ted Herman , Sukumar Ghosh Stabilizing Phase-Clocks. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:259-265 [Journal ] Eddy Fromentin , Claude Jard , Guy-Vincent Jourdan , Michel Raynal On-The-Fly Analysis of Distributed Computations. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:267-274 [Journal ] Kokichi Sugihara , Hiroshi Inagaki Why is the 3D Delaunay Triangulation Difficult to Construct. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:275-280 [Journal ] Stéphane Demri 3-SAT=SAT for a Class of Normal Modal Logics. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:281-287 [Journal ] Kazuo Iwama , Toniann Pitassi Exponential Lower Bounds for the Tree-Like Hajós Calculus. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:289-294 [Journal ] Akihiro Fujiwara , Toshimitsu Masuzawa , Hideo Fujiwara An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:295-300 [Journal ] Aart Blokhuis , Ton Kloks On the Equivalence Covering Number of Splitgraphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:301-304 [Journal ] G. Sajith , Sanjeev Saxena Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:54, n:5, pp:305- [Journal ]