default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeir Dahl
Person information
- affiliation: University of Oslo, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Richard A. Brualdi, Geir Dahl
:
Frobenius-König theorem for classes of (0,±1)-matrices. Discret. Math. 347(6): 113951 (2024)- [j44]Richard A. Brualdi, Geir Dahl:
Multipermutations and Stirling Multipermutations. Graphs Comb. 40(1): 22 (2024) - 2022
- [j43]Richard A. Brualdi, Geir Dahl:
Permutation graphs and the weak Bruhat order. Art Discret. Appl. Math. 6(3): 3 (2022) - 2021
- [j42]Richard A. Brualdi, Geir Dahl:
Convex (0, 1)-matrices and their epitopes. Discret. Appl. Math. 297: 21-34 (2021) - 2020
- [j41]Richard A. Brualdi, Geir Dahl:
Alternating Sign Matrices: Extensions, König-Properties, and Primary Sum-Sequences. Graphs Comb. 36(1): 63-92 (2020)
2010 – 2019
- 2019
- [j40]Richard A. Brualdi, Geir Dahl:
The interval structure of (0, 1)-matrices. Discret. Appl. Math. 266: 3-15 (2019) - 2018
- [j39]Richard A. Brualdi, Geir Dahl:
Alternating sign matrices and hypermatrices, and a generalization of Latin squares. Adv. Appl. Math. 95: 116-151 (2018) - 2017
- [j38]Richard A. Brualdi, Geir Dahl:
Alternating sign matrices, extensions and related cones. Adv. Appl. Math. 86: 19-49 (2017) - [j37]Agostinho Agra, Geir Dahl, Torkel Andreas Haufmann, Sofia J. Pinheiro:
The k-regular induced subgraph problem. Discret. Appl. Math. 222: 14-30 (2017) - 2015
- [j36]Maria Charina, Geir Dahl:
Subdivision schemes, network flows and linear optimization. Adv. Comput. Math. 41(3): 507-528 (2015) - [j35]Richard A. Brualdi, Geir Dahl:
Strict Sign-Central Matrices. SIAM J. Matrix Anal. Appl. 36(3): 1202-1220 (2015) - 2013
- [j34]Richard A. Brualdi, Geir Dahl:
Majorization for partially ordered sets. Discret. Math. 313(22): 2592-2601 (2013) - [j33]Geir Dahl, Fuzhen Zhang:
Integral majorization Polytopes. Discret. Math. Algorithms Appl. 5(3) (2013) - 2012
- [j32]Fred E. Benth, Geir Dahl, Carlo Mannino:
Computing Optimal Recovery Policies for Financial Markets. Oper. Res. 60(6): 1373-1388 (2012) - 2010
- [j31]Geir Dahl, Harald Minken:
A note on permutations and rank aggregation. Math. Comput. Model. 52(1-2): 380-385 (2010)
2000 – 2009
- 2009
- [j30]Geir Dahl, Truls Flatberg:
Reconstructing (0, 1)-matrices from projections using integer programming. Comput. Optim. Appl. 42(1): 141-154 (2009) - [j29]Geir Dahl:
Disjoint congruence classes and a timetabling application. Discret. Appl. Math. 157(8): 1702-1710 (2009) - [j28]Michael O. Ball, Geir Dahl, Thomas Vossen:
Matchings in connection with ground delay program planning. Networks 53(3): 293-306 (2009) - 2008
- [j27]Geir Dahl, Harald Minken:
Methods based on discrete optimization for finding road network rehabilitation strategies. Comput. Oper. Res. 35(7): 2193-2208 (2008) - 2007
- [j26]Geir Dahl:
A note on a parameter relating traffic equilibria and system optimal routing. Appl. Math. Comput. 191(2): 445-450 (2007) - [j25]Geir Dahl:
Majorization and distances in trees. Networks 50(4): 251-257 (2007) - [p2]Geir Dahl, Truls Flatberg:
An Integer Programming Approach to Image Segmentation and Reconstruction Problems. Geometric Modelling, Numerical Simulation, and Optimization 2007: 475-496 - 2006
- [j24]Geir Dahl, Njål Foldnes:
LP based heuristics for the multiple knapsack problem with assignment restrictions. Ann. Oper. Res. 146(1): 91-104 (2006) - [j23]Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau:
On the k edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34(5): 577-582 (2006) - [p1]Geir Dahl, Luis Eduardo Neves Gouveia, Cristina Requejo:
On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. Handbook of Optimization in Telecommunications 2006: 493-515 - 2005
- [j22]Geir Dahl, Truls Flatberg:
Optimization and reconstruction of hv-convex (0, 1)-matrices. Discret. Appl. Math. 151(1-3): 93-105 (2005) - [j21]Geir Dahl, Truls Flatberg:
A remark concerning graphical sequences. Discret. Math. 304(1-3): 62-64 (2005) - [j20]Geir Dahl, Richard A. Brualdi:
Matrices of zeros and ones with given line sums and a zero block. Electron. Notes Discret. Math. 20: 83-97 (2005) - 2004
- [j19]Geir Dahl, Truls Flatberg:
Some constrained partitioning problems and majorization. Eur. J. Oper. Res. 158(2): 434-443 (2004) - [j18]Geir Dahl, Bjarne Johannessen:
The 2-path network problem. Networks 43(3): 190-199 (2004) - [j17]Geir Dahl, Luis Eduardo Neves Gouveia:
On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32(1): 15-22 (2004) - [j16]Geir Dahl, Njål Foldnes, Luis Eduardo Neves Gouveia:
A note on hop-constrained walk polytopes. Oper. Res. Lett. 32(4): 345-349 (2004) - 2003
- [j15]Geir Dahl, Truls Flatberg:
Optimization and reconstruction of hv-convex (0, 1)-matrices. Electron. Notes Discret. Math. 12: 58-69 (2003) - [j14]Geir Dahl, Njål Foldnes:
Complete description of a class of knapsack polytopes. Oper. Res. Lett. 31(3): 335-340 (2003) - 2002
- [j13]Geir Dahl, Geir Storvik, Alice Fadnes:
Large-Scale Integer Programs in Image Analysis. Oper. Res. 50(3): 490-500 (2002) - 2000
- [j12]Geir Dahl, Bjørnar Realfsen:
The cardinality-constrained shortest path problem in 2-graphs. Networks 36(1): 1-8 (2000) - [j11]Geir Storvik, Geir Dahl:
Lagrangian-based methods for finding MAP solutions for MRF models. IEEE Trans. Image Process. 9(3): 469-479 (2000)
1990 – 1999
- 1999
- [j10]Geir Dahl, Alexander Martin, Mechthild Stoer:
Routing Through Virtual Paths in Layered Telecommunication Networks. Oper. Res. 47(5): 693-702 (1999) - [j9]Geir Dahl:
Notes on polyhedra associated with hop-constrained paths. Oper. Res. Lett. 25(2): 97-100 (1999) - [j8]Geir Dahl:
Stable Set Polytopes for a Class of Circulant Graphs. SIAM J. Optim. 9(2): 493-503 (1999) - 1998
- [j7]Geir Dahl, Mechthild Stoer:
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. INFORMS J. Comput. 10(1): 1-11 (1998) - [j6]Geir Dahl, François Margot:
Weak k-majorization and polyhedra. Math. Program. 81: 37-53 (1998) - [j5]Geir Dahl:
Polytopes related to the linfinity-distance between vectors. Oper. Res. Lett. 22(1): 49-54 (1998) - [j4]Geir Dahl:
The 2-hop spanning tree problem. Oper. Res. Lett. 23(1-2): 21-26 (1998) - 1995
- [c1]Geir Dahl:
Polyhedra and Optimization in Connection with a Weak Majorization Ordering. IPCO 1995: 426-437 - 1994
- [j3]Geir Dahl, Kurt Jörnsten, G. Løvnes, S. Svaet:
Graph optimization problems in connection with the management of mobile communications systems. Telecommun. Syst. 3(3): 319-339 (1994) - 1993
- [j2]Geir Dahl:
Directed Steiner Problems with Connectivity Constraints. Discret. Appl. Math. 47(2): 109-128 (1993) - [j1]Geir Dahl:
The design of survivable directed networks. Telecommun. Syst. 2(1): 349-377 (1993)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 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:
