Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. AAIM 2007: Portland, OR, USA
- Ming-Yang Kao, Xiang-Yang Li:
Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings. Lecture Notes in Computer Science 4508, Springer 2007, ISBN 978-3-540-72868-9
Graph Algorithms
- Gerold Jäger, Anand Srivastav, Katja Wolf:
Solving Generalized Maximum Dispersion with Linear Programming. 1-10 - Marco Gaertler
, Robert Görke, Dorothea Wagner:
Significance-Driven Graph Clustering. 11-26 - Zhi-Zhong Chen, Ruka Tanahashi:
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. 27-36 - Boting Yang, Yi Cao:
Digraph Strong Searching: Monotonicity and Complexity. 37-46
Combinatorics
- Martin Fürer, Shiva Prasad Kasiviswanathan:
Algorithms for Counting 2-SatSolutions and Colorings with Applications. 47-57 - Joachim Giesen, Dieter Mitsche, Eva Schuberth:
Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation. 58-67 - Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Rectangular Drawings with Efficient Query Supports. 68-81 - M. Sohel Rahman, Costas S. Iliopoulos:
A New Efficient Algorithm for Computing the Longest Common Subsequence. 82-90
Scheduling
- Baoqiang Fan, Jianzhong Gu, Guochun Tang:
Scheduling a Flexible Batching Machine. 91-99 - Hyun Joon Shin:
Global Search Method for Parallel Machine Scheduling. 100-107 - Subhash C. Sarin, Vinod D. Shenai, Lixin Wang:
Releasing and Scheduling of Lots in a Wafer Fab. 108-119 - Chad R. Meiners, Eric Torng:
Mixed Criteria Packet Scheduling. 120-133
Graph Theory
- Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu:
Efficient Algorithms for k -Disjoint Paths Problems on DAGs. 134-143 - Rahul Muthu, N. Narayanan, C. R. Subramanian:
Acyclic Edge Colouring of Outerplanar Graphs. 144-152 - Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-sheng Hsu:
Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract). 153-166 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. 167-177
Network Algorithm
- Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. 178-190 - Francis Y. L. Chin, Yong Zhang, Hong Zhu:
Online OVSF Code Assignment with Resource Augmentation. 191-200 - Richard J. Boucherie, Aloysius Irwan Endrayanto, Adriana Felicia Gabor:
Optimal Joint Rate and Power Allocation in CDMA Networks. 201-210 - Hongkyu Jeong, Kyoung Y. Bae, Jinoo Joung:
Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers. 211-220
Game Theory
- Steve Butler, Jia Mao, Ronald L. Graham:
How to Play the Majority Game with Liars. 221-230 - Vittorio Bilò:
On Satisfiability Games and the Power of Congestion Games. 231-240 - ChenGuang Liu, Kazuyuki Tanaka:
The Complexity of Algorithms Computing Game Trees on Random Assignments. 241-250
Option Theory
- Tian-Shyr Dai, Yuh-Dauh Lyuu:
An Efficient, and Fast Convergent Algorithm for Barrier Options. 251-261 - Tian-Shyr Dai, Jr-Yan Wang, Hui-Shan Wei:
An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options. 262-272 - Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso:
Optimal Order Allocation with Discount Pricing. 273-284
Computational Geometry
- Hanno Lefmann:
Convex Hulls of Point-Sets and Non-uniform Hypergraphs. 285-295 - Huaming Zhang, Xin He:
Optimal st -Orientations for Plane Triangulations. 296-305 - Yang Yang, Mingen Lin, Jinhui Xu, Yulai Xie:
Minimum Spanning Tree with Neighborhoods. 306-316 - Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi:
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. 317-326 - Xiaodong Wu, Xin Dou:
Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy. 327-336
Graph Theory and Combinatorics
- Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas:
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. 337-345 - Dan He:
BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps. 346-357 - Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Strip Packing vs. Bin Packing. 358-367 - David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier:
Probe Matrix Problems: Totally Balanced Matrices. 368-377
Networks and Data
- Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong:
Efficiency of Data Distribution in BitTorrent-Like Systems. 378-388 - Ka Ho Chan, Xiaowen Chu:
Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers. 389-398 - Minghui Jiang:
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. 399-410 - Hong Seo Ryoo, In-Yong Jang:
A Heuristic Method for Selecting Support Features from Large Datasets. 411-423
Invited Lecture
- Shang-Hua Teng:
Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. 424 - Anna R. Karlin:
Ad Auctions - Current and Future Research. 425 - Tuomas Sandholm:
Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. 426
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
