| 2012 | Online Coloring of Bipartite Graphs with and without Advice. | Maria Paola Bianchi, Hans-Joachim Bckenhauer, Juraj Hromkovic, Lucia Keller |
| 2012 | External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue. | Alka Bhushan, Sajith Gopalan |
| 2012 | A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. | Binay K. Bhattacharya, Tsunehiko Kameda |
| 2012 | Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs. | Ivona Bezkov, Zachary Langley |
| 2012 | Towards Optimal and Expressive Kernelization for d-Hitting Set. | Ren van Bevern |
| 2012 | Ramsey Numbers for Line Graphs and Perfect Graphs. | Rmy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei |
| 2012 | Speed Scaling for Maximum Lateness. | Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois |
| 2012 | An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks. | Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov |
| 2012 | Geometric RAC Simultaneous Drawings of Graphs. | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis |
| 2012 | Geodesic Order Types. | Oswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber |
| 2011 | Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems. | Daming Zhu, Shaohan Ma, Pingping Zhang |
| 2011 | Competitive Algorithms for Online Pricing. | Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting |
| 2011 | A New Conditionally Anonymous Ring Signature. | Shengke Zeng, Shaoquan Jiang, Zhiguang Qin |
| 2011 | Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum. | Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Francis C. M. Lau |
| 2011 | Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems. | Tomoyuki Yamakami |
| 2011 | Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory. | Ryan Williams |
| 2011 | Algorithms for Partition of Some Class of Graphs under Compaction. | Narayan Vikas |
| 2011 | On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. | Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou |
| 2011 | Making Abstraction-Refinement Efficient in Model Checking. | Cong Tian, Zhenhua Duan |
| 2011 | An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times. | Guozhen Tan, Jinghao Sun |
| 2011 | Bandwidth of Convex Bipartite Graphs and Related Graphs. | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno |
| 2011 | Exploiting the Robustness on Power-Law Networks. | Yilin Shen, Nam P. Nguyen, My T. Thai |
| 2011 | Strong I/O Lower Bounds for Binomial and FFT Computation Graphs. | Desh Ranjan, John E. Savage, Mohammad Zubair |
| 2011 | The Topology Aware File Distribution Problem. | Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang |
| 2011 | Finding Paths with Minimum Shared Edges. | Masoud T. Omran, Jrg-Rdiger Sack, Hamid Zarrabi-Zadeh |