Journals in DBLP
Klaus Simon A Note on Lexicographic Breadt First Search for Chordal Graphs. [Citation Graph (0, 0)][DBLP ] 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 ] Journal ] Ted Herman , Sukumar Ghosh Stabilizing Phase-Clocks. [Citation Graph (0, 0)][DBLP ] Journal ] Eddy Fromentin , Claude Jard , Guy-Vincent Jourdan , Michel Raynal On-The-Fly Analysis of Distributed Computations. [Citation Graph (0, 0)][DBLP ] Journal ] Kokichi Sugihara , Hiroshi Inagaki Why is the 3D Delaunay Triangulation Difficult to Construct. [Citation Graph (0, 0)][DBLP ] Journal ] Stéphane Demri 3-SAT=SAT for a Class of Normal Modal Logics. [Citation Graph (0, 0)][DBLP ] Journal ] Kazuo Iwama , Toniann Pitassi Exponential Lower Bounds for the Tree-Like Hajós Calculus. [Citation Graph (0, 0)][DBLP ] 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 ] Journal ] Aart Blokhuis , Ton Kloks On the Equivalence Covering Number of Splitgraphs. [Citation Graph (0, 0)][DBLP ] 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 ] Journal ] 