Conferences in DBLP
Jean-Daniel Boissonnat Voronoi-Based Systems of Coordinates and Surface Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai Essentially Every Unimodular Matrix Defines and Expander. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Evangelos Kranakis , Danny Krizanc , Miguel Vargas Martin , Jurek Czyzowicz , Andrzej Pelc , Leszek Gasieniec Strategies for Hotlink Assignments. [Citation Graph (0, 0)][DBLP ] Conf ] Ching Law , Charles E. Leiserson A New Competitive Analysis of Randomized Caching. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Pat Morin , Andrej Brodnik , Svante Carlsson , Erik D. Demaine , Rudolf Fleischer , J. Ian Munro , Alejandro López-Ortiz Online Routing in Convex Subdivisions. [Citation Graph (0, 0)][DBLP ] Conf ] Jingui Huang , Jianer Chen , Songqiao Chen A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Takayuki Osogami , Hiroshi Imai Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yuyu Chen , Ming-Yang Kao , Hsueh-I Lu Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Ugo Vaccaro coping with Delays and Time-Outs in Binary Search Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Zhixiang Chen , Binhai Zhu Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Takashi Horiyama , Toshihide Ibaraki Reasoning with Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Iyad A. Kanj On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Yi Zhou , Guojun Li , Wenan Zang A 2-Approximation Algorithm for Path Coloring on Trees of Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Q. S. Wu , Chin Lung Lu , Richard C. T. Lee An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Takao Nishizeki Finding Independent Spanning Trees in Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Niedermeier , Peter Rossmanith On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitrios M. Thilikos , Maria J. Serna , Hans L. Bodlaender Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Takao Asano , Magnús M. Halldórsson , Kazuo Iwama , Takeshi Matsuda Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Norihiro Kubo , Shinichi Shimozono , Katsuhiro Muramoto A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Frits C. R. Spieksma Simple Algorithms for a Weighted Interval Selection Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Chin Lung Lu , Sheng-Lung Peng , Chuan Yi Tang Efficient Minus and Signed Domination in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyuki Miura , Takao Nishizeki , Shin-Ichi Nakano Convex Grid Drwaings of Four-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Seok-Hee Hong , Peter Eades An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Masashi Katsura , Yuji Kobayashi , Friedrich Otto Undecidability Results for Monoids with Linear-Time Decidable Word Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Reina Yoshikawa , Shimin Guo , Kazuhiro Motegi , Yoshihide Igarashi Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Jen Lu Derandomizing Arthur-Merlin Games under Uniform Assumptions. [Citation Graph (0, 0)][DBLP ] Conf ] Bill Jackson , Tibor Jordán A Near Optimal Algorithm for Vertex Connectivity Augmentation. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Ishii , Hiroshi Nagamochi Simultaneous Augmentation of Two Graphs to an l -Edge-Connected Graph and a Biconnected Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Hiro Ito , Yuichiro Itatsu , Hideyuki Uehara , Mitsuo Yokoyama , Motoyasu Ito Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Lihua Liu , Songqiao Chen , Weijia Jia An Intuitive and Effective New Representation for Interconnection Network Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Koji Nakano , Stephan Olariu Randomized Leader Election Protocols in Radio Networks with No Collision Detection. [Citation Graph (0, 0)][DBLP ] Conf ] Gianluca De Marco , Andrzej Pelc Deterministic Broadcasting Time with Partial Knowledge of the Network. [Citation Graph (0, 0)][DBLP ] Conf ] Chung Keung Poon , Pixing Zhang Minimizing Makespan in Batch Machine Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Lorant Porkolab Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Kunihiko Sadakane Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Wolff , Michael Thon , Yin-Feng Xu A Better Lower Bound for Two-Circle Point Labeling. [Citation Graph (0, 0)][DBLP ] Conf ] Deok-Soo Kim , Donguk Kim , Kokichi Sugihara Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Pat Morin An Improved Algorithm for Subdivision Traversal without Extra Storage. [Citation Graph (0, 0)][DBLP ] Conf ] Petter Kristiansen , Jan Arne Telle Generalized H -Coloring of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Biing-Feng Wang , Jyh-Jye Lin Finding a Two-Core of a Tree in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Xiaobo Hu , Jinhui Xu Optimal Beam Penetrations in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Xuehou Tan Searching a Simple Polygon by a k -Searcher. [Citation Graph (0, 0)][DBLP ] Conf ] Sang-Min Park , Kyung-Yong Chwa , Jae-Ha Lee Characterization of Rooms Searchable by Two Guards. [Citation Graph (0, 0)][DBLP ] Conf ] Wing-Kai Hon , Ming-Yang Kao , Tak Wah Lam Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. [Citation Graph (0, 0)][DBLP ] Conf ] Guo-Hui Lin , Tao Jiang , Paul E. Kearney Phylogenetic k -Root and Steiner k -Root. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew J. Katz , Frank Nielsen , Michael Segal Maintenance of a Percing Set for Intervals with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Xiaobo Hu , Xiaodong Wu Optimal Polygon Cover Problems and Applcations. [Citation Graph (0, 0)][DBLP ] Conf ] 