| 2004 | A 3-Approximation for the Pathwidth of Halin Graphs. Fedor V. Fomin, Dimitrios M. Thilikos |
| 2004 | A New Local Condition for a Graph to be Hamiltonian. Armen S. Asratian |
| 2004 | A Particular Class of Graphic Matroids. Francesco Maffioli, Norma Zagaglia Salvi |
| 2004 | A Primal-Dual Method for Approximating Tree Cover with Two Weights. Takashi Doi, Toshihiro Fujito |
| 2004 | A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks. Dmitrii Lozovanu, Stefan Wolfgang Pickl |
| 2004 | About the b-Continuity of Graphs. Taoufik Faik |
| 2004 | Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. Edoardo Amaldi, Leo Liberti, Francesco Maffioli |
| 2004 | An Asymmetric Vehicle Routing Problem arising in the Collection and Disposal of Special Waste. Roberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato |
| 2004 | An Improved Discrepancy Approach to Declustering. Benjamin Doerr, Nils Hebbinghaus, Sören Werth |
| 2004 | An Improved Local Search Algorithm for 3-SAT. Tobias Brüggemann, Walter Kern |
| 2004 | Behzad-Vizing Conjecture and Cartesian Product Graphs. Blaz Zmazek, Janez Zerovnik |
| 2004 | CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004 Leo Liberti, Francesco Maffioli |
| 2004 | Clique Algorithms for Classifying Substructures in Generalized Quadrangles. Miroslava Cajkova, Veerle Fack |
| 2004 | Clique, Chromatic, and Lovász Numbers of Certain Circulant Graphs. Valentin E. Brimkov |
| 2004 | Coloring Graphs with Minimal Edge Load. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav |
| 2004 | Computing Optimal Discrete Morse Functions. Michael Joswig, Marc E. Pfetsch |
| 2004 | Connections between Continuous and Combinatorial Optimization Problems through an Extension of the Fundamental Theorem of Linear Programming. Fabio Tardella |
| 2004 | Covering Graphs by Colored Stable Sets. Ulrich Faigle, Bernhard Fuchs, Britta Wienand |
| 2004 | Decomposition of Consecutive-1 Matrices and Applications. Horst W. Hamacher |
| 2004 | Discrepancy of Sums of Arithmetic Progressions. Nils Hebbinghaus |
| 2004 | Dynamic Programming Algorithms for the Elementary Shortest Path Problem with Resource Constraints. Giovanni Righini, Matteo Salani |
| 2004 | Exact Algorithms for a Discrete Metric Labeling Problem. Gaia Nicosia, Andrea Pacifici |
| 2004 | Extended Distance-Hereditary Graphs. Méziane Aïder |
| 2004 | Fast and Simple Algorithms for Weighted Perfect Matching. Mirjam Wattenhofer, Roger Wattenhofer |
| 2004 | Heavy Cycles in k-connected Weighted Graphs. Shenggui Zhang, Bing Chen, Rongzu Yu |
| 2004 | Knowledge State Algorithms and the 2-Server Problem. Wolfgang W. Bein |
| 2004 | Lexico-smallest Representations, Duality and Matching Polyhedra. Komei Fukuda, Stefano Picozzi |
| 2004 | Linear Time Algorithms to the Minimum All-Ones Problem for UniCyclic and Bicyclic Graphs. William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang |
| 2004 | Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs. Paolo Detti, Carlo Meloni, Marco Pranzo |
| 2004 | Minimum Weighted Feedback Vertex Set on Diamonds. Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato |
| 2004 | Minimum-Cost Single-Source 2-Splittable Flow. Stavros G. Kolliopoulos |
| 2004 | More on Orbital Matrices. Harald Gropp |
| 2004 | Multiway Cut and Integer Flow Problems in Trees. Marie-Christine Costa, Alain Billionnet |
| 2004 | Network Design with Grooming Constraints. Pietro Belotti, Federico Malucelli |
| 2004 | New Exponential Neighbourhood for Polynomially Solvable TSPs. Vladimir G. Deineko |
| 2004 | On (P Jean-Luc Fouquet, Jean-Marie Vanherpe |
| 2004 | On Cliques associated to 3-set Packing Problems. Luis Miguel Torres |
| 2004 | On Deviation Measures in Stochastic Integer Programming. Andreas Märkert, Rüdiger Schultz |
| 2004 | On a Packet Scheduling Problem for Smart Antennas and Polyhedra Defined Circular-ones Matrices. Dion Gijswijt |
| 2004 | On the Generation of Bicliques of a Graph. Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter |
| 2004 | On the Strongly Connected and Biconnected Components of the Complement of Graphs. Stavros D. Nikolopoulos, Leonidas Palios |
| 2004 | Polynomial Solvability of Mader's Edge-disjoint Paths Problem. Leen Stougie |
| 2004 | Semi-preemptive Routing on a Line. Dirk Räbiger |
| 2004 | Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs. Akihiro Uejima, Hiro Ito |
| 2004 | Submodular Function Minimization in Zeta Maurice Queyranne |
| 2004 | The Complexity of Arc-coloring for Directed Hypergraphs. Andrea Vietri |
| 2004 | The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic. M. Reza Emamy-Khansary |
| 2004 | The Demand-dependent Optimization of Regular Train Timetables. Alessandro Chierici, Roberto Cordone, Roberto Maja |
| 2004 | The Kissing Number Problem: A New Result from Global Optimization. Leo Liberti, Nelson Maculan, Sergei S. Kucherenko |
| 2004 | The Multicommodity Multilevel Bottleneck Assignment Problem. Roberto Aringhieri, Roberto Cordone |
| 2004 | The Proper Interval Colored Graph Problem for Caterpillar Trees. C. Àlvarez, N. Serna |
| 2004 | The Ramsey Numbers of Paths Versus Kipases. A. N. M. Salman, Hajo Broersma |
| 2004 | The Set of Prime Extensions of a Graph: the Finite and the Infinite Case. Vassilis Giakoumakis, Stephan Olariu |
| 2004 | To be or not to be Yutsis. Dries Van Dyck, Veerle Fack |
| 2004 | Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann |
| 2004 | Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm. Domenico Cantone, Simone Faro |
| 2004 | Virtual Private Network Design Under Traffic Uncertainty. Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar |
| 2004 | k-Pseudosnakes in n-dimensional Hypercubes. Erich Prisner |