Directed Steiner Problems with Connectivity Constraints. - Geir Dahl (Discret. Appl. Math., 1993)

The design of survivable directed networks. - Geir Dahl (Telecommun. Syst., 1993)

Graph optimization problems in connection with the management of mobile communications systems. - Geir Dahl; Kurt Jörnsten; G. Løvnes; S. Svaet (Telecommun. Syst., 1994)

Polyhedra and Optimization in Connection with a Weak Majorization Ordering. - Geir Dahl (IPCO, 1995)

A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. - Geir Dahl; Mechthild Stoer (INFORMS J. Comput., 1998)

Weak k-majorization and polyhedra. - Geir Dahl; François Margot (Math. Program., 1998)

The 2-hop spanning tree problem. - Geir Dahl (Oper. Res. Lett., 1998)

Polytopes related to the linfinity-distance between vectors. - Geir Dahl (Oper. Res. Lett., 1998)

Routing Through Virtual Paths in Layered Telecommunication Networks. - Geir Dahl; Alexander Martin 001; Mechthild Stoer (Oper. Res., 1999)

Notes on polyhedra associated with hop-constrained paths. - Geir Dahl (Oper. Res. Lett., 1999)

Stable Set Polytopes for a Class of Circulant Graphs. - Geir Dahl (SIAM J. Optim., 1999)

The cardinality-constrained shortest path problem in 2-graphs. - Geir Dahl; Bjørnar Realfsen (Networks, 2000)

Lagrangian-based methods for finding MAP solutions for MRF models. - Geir Storvik; Geir Dahl (IEEE Trans. Image Process., 2000)

Large-Scale Integer Programs in Image Analysis. - Geir Dahl; Geir Storvik; Alice Fadnes (Oper. Res., 2002)

Optimization and reconstruction of hv-convex (0, 1)-matrices. - Geir Dahl; Truls Flatberg (Electron. Notes Discret. Math., 2003)

Complete description of a class of knapsack polytopes. - Geir Dahl; Njål Foldnes (Oper. Res. Lett., 2003)

Some constrained partitioning problems and majorization. - Geir Dahl; Truls Flatberg (Eur. J. Oper. Res., 2004)

The 2-path network problem. - Geir Dahl; Bjarne Johannessen (Networks, 2004)

A note on hop-constrained walk polytopes. - Geir Dahl; Njål Foldnes; Luis Eduardo Neves Gouveia (Oper. Res. Lett., 2004)

On the directed hop-constrained shortest path problem. - Geir Dahl; Luis Eduardo Neves Gouveia (Oper. Res. Lett., 2004)

Optimization and reconstruction of hv-convex (0, 1)-matrices. - Geir Dahl; Truls Flatberg (Discret. Appl. Math., 2005)

A remark concerning graphical sequences. - Geir Dahl; Truls Flatberg (Discret. Math., 2005)

Matrices of zeros and ones with given line sums and a zero block. - Geir Dahl; Richard A. Brualdi (Electron. Notes Discret. Math., 2005)

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. - Geir Dahl; Luis Eduardo Neves Gouveia; Cristina Requejo (Handbook of Optimization in Telecommunications, 2006)

LP based heuristics for the multiple knapsack problem with assignment restrictions. - Geir Dahl; Njål Foldnes (Ann. Oper. Res., 2006)

On the k edge-disjoint 2-hop-constrained paths polytope. - Geir Dahl; David Huygens; Ali Ridha Mahjoub; Pierre Pesneau (Oper. Res. Lett., 2006)

An Integer Programming Approach to Image Segmentation and Reconstruction Problems. - Geir Dahl; Truls Flatberg (Geometric Modelling, Numerical Simulation, and Optimization, 2007)

A note on a parameter relating traffic equilibria and system optimal routing. - Geir Dahl (Appl. Math. Comput., 2007)

Majorization and distances in trees. - Geir Dahl (Networks, 2007)

Methods based on discrete optimization for finding road network rehabilitation strategies. - Geir Dahl; Harald Minken (Comput. Oper. Res., 2008)

Reconstructing (0, 1)-matrices from projections using integer programming. - Geir Dahl; Truls Flatberg (Comput. Optim. Appl., 2009)

Disjoint congruence classes and a timetabling application. - Geir Dahl (Discret. Appl. Math., 2009)

Matchings in connection with ground delay program planning. - Michael O. Ball; Geir Dahl; Thomas Vossen (Networks, 2009)

A note on permutations and rank aggregation. - Geir Dahl; Harald Minken (Math. Comput. Model., 2010)

Computing Optimal Recovery Policies for Financial Markets. - Fred E. Benth; Geir Dahl; Carlo Mannino (Oper. Res., 2012)

Majorization for partially ordered sets. - Richard A. Brualdi; Geir Dahl (Discret. Math., 2013)

Integral majorization Polytopes. - Geir Dahl; Fuzhen Zhang (Discret. Math. Algorithms Appl., 2013)

Subdivision schemes, network flows and linear optimization. - Maria Charina; Geir Dahl (Adv. Comput. Math., 2015)

Strict Sign-Central Matrices. - Richard A. Brualdi; Geir Dahl (SIAM J. Matrix Anal. Appl., 2015)

Alternating sign matrices, extensions and related cones. - Richard A. Brualdi; Geir Dahl (Adv. Appl. Math., 2017)

The k-regular induced subgraph problem. - Agostinho Agra; Geir Dahl; Torkel Andreas Haufmann; Sofia J. Pinheiro (Discret. Appl. Math., 2017)

Alternating sign matrices and hypermatrices, and a generalization of Latin squares. - Richard A. Brualdi; Geir Dahl (Adv. Appl. Math., 2018)

The interval structure of (0, 1)-matrices. - Richard A. Brualdi; Geir Dahl (Discret. Appl. Math., 2019)

Alternating Sign Matrices: Extensions, König-Properties, and Primary Sum-Sequences. - Richard A. Brualdi; Geir Dahl (Graphs Comb., 2020)

Convex (0, 1)-matrices and their epitopes. - Richard A. Brualdi; Geir Dahl (Discret. Appl. Math., 2021)

Permutation graphs and the weak Bruhat order. - Richard A. Brualdi; Geir Dahl (Art Discret. Appl. Math., 2022)

Frobenius-König theorem for classes of (0,±1)-matrices. - Richard A. Brualdi; Geir Dahl (Discret. Math., 2024)

Multipermutations and Stirling Multipermutations. - Richard A. Brualdi; Geir Dahl (Graphs Comb., 2024)