Conferences in DBLP
Toshihide Ibaraki Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Akira Tajima , Shinji Misono Airline Crew-Scheduling Problem with Many Irregular Flights. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyoshi Hidaka , Hiroyuki Okano Practical Approach to a Facility Location Problem for Large-Scale Logistics. [Citation Graph (0, 0)][DBLP ] Conf ] Satoshi Horie , Osamu Watanabe Hard Instance Generation for SAT (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Miroslaw Kutylowski , Rolf Wanka Playing Tetris on Meshes and Multi-Dimensional SHEARSORT. [Citation Graph (0, 0)][DBLP ] Conf ] Kaihiro Matsuura , Akira Nagoya Formulation of the Addition-Shift-Sequence Problem and Its Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuya Hayashi , Koji Nakano , Stephan Olariu Weighted and Unweighted Selection Algorithms for k Sorted Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Leqiang Bai , Hiroyuki Ebara , Hideo Nakano , Hajime Maeda An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Qian-Ping Gu , Hisao Tamaki Multi-Color Routing in the Undirected Hypercube. [Citation Graph (0, 0)][DBLP ] Conf ] Tzuoo-Hawn Yeh , Cheng-Ming Kuo , Chin-Laung Lei , Hsu-Chun Yen Competitive Source Routing on Tori and Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Takeaki Uno Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Ishii , Hiroshi Nagamochi , Toshihide Ibaraki Augmenting Edge and Vertex Connectivities Simultaneously. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Eiter , Toshihide Ibaraki , Kazuhisa Makino Two-Face Horn Extensions. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Ausiello , Paolo Giulio Franciosa , Daniele Frigioni , Roberto Giaccio Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Charles E. Leiserson Algorithmic Analysis of Multithreaded Algorithms (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Hisao Tamaki , Takeshi Tokuyama A Characterization of Planar Graphs by Pseudo-Line Arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Petrisor Panaite , Andrzej Pelc Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Takao Asano , Kuniaki Hori , Takao Ono , Tomio Hirata A Theoretical Framework of Hybrid Approaches to MAX SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Takashi Horiyama , Shuzo Yajima Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion. [Citation Graph (0, 0)][DBLP ] Conf ] Eisuke Dannoura , Kouichi Sakurai On-Line Versus Off-Line in Money-Making Strategies with BROKERAGE. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Christos H. Papadimitriou Decision-Making by Hierarchies of Discordant Agents. [Citation Graph (0, 0)][DBLP ] Conf ] Khanh Quoc Nguyen , Vijay Varadharajan , Yi Mu A New Efficient Off-line Anonymous Cash Scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen Approximating Unweighted Connectivity Problems in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Chung Keung Poon , Vijaya Ramachandran A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah Efficient Parallel Algorithms for Planar st -Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Ravikumar Peg-Solitaire, String Rewriting Systems and Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Hartmut Klauck On the Size of Probabilistic Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Ryabko , Andrei Fionov Homophonic Coding with Logarithmic Memory Size. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf H. Möhring , Matthias Müller-Hannemann Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. [Citation Graph (0, 0)][DBLP ] Conf ] Tsuyoshi Minakawa , Kokichi Sugihara Topology Oriented vs. Exact Arithmetic - Experience in Implementing the Three-Dimensional Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Ott , Frank Stephan The Complexity of Learning Branches and Strategies from Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriele Neyer , Peter Widmayer Singularities Make Spatial Join Scheduling Hard. [Citation Graph (1, 0)][DBLP ] Conf ] Hsiao-Feng Steven Chen , D. T. Lee A Faster One-Dimensional Topological Compaction Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Francis Y. L. Chin Algorithms for Finding Optimal Disjoint Paths Around a Rectangle. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshiyuki Kusakari , Takao Nishizeki An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals. [Citation Graph (0, 0)][DBLP ] Conf ] Penny E. Haxell , Martin Loebl On Defect Sets in Bipartite Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Maw-Shang Chang , Sun-Yuan Hsieh , Gen-Huey Chen Dynamic Programming on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Serafino Cicerone , Gabriele Di Stefano On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting All-Cavity Maximum Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] S. V. Rao , Asish Mukhopadhyay Fast Algorithms for Computing beta-Skeletons and Their Relatives. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshiaki Kyoda , Keiko Imai , Fumihiko Takeuchi , Akira Tajima A Branch-and-Cut Approach for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Kellerer , Ulrich Pferschy , Maria Grazia Speranza An Efficient Approximation Scheme for the Subset-Sum Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Grammati E. Pantziou , George P. Pentaris , Paul G. Spirakis Competitive Call Control in Mobile Networks. [Citation Graph (0, 0)][DBLP ] Conf ] B. John Oommen , Juan Dong Generalized Swap-with-Parent Schemes for Self-Organizing Sequential Linear Lists. [Citation Graph (0, 0)][DBLP ] Conf ] 