Pierre Hansen

From MaRDI portal
Revision as of 04:50, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:190032

Available identifiers

zbMath Open hansen.pierreDBLPh/PierreHansenWikidataQ28872467 ScholiaQ28872467MaRDI QIDQ190032

List of research outcomes

PublicationDate of PublicationType
Distributed integral column generation for set partitioning problems2022-05-17Paper
Global exact optimization for covering a rectangle with 6 circles2022-04-25Paper
https://portal.mardi4nfdi.de/entity/Q51651672021-11-15Paper
https://portal.mardi4nfdi.de/entity/Q51592232021-10-26Paper
Distance Laplacian eigenvalues and chromatic number in graphs2021-10-18Paper
https://portal.mardi4nfdi.de/entity/Q51563852021-10-15Paper
Corrigendum to: ``On the difference of energies of a graph and its complement graph2021-09-02Paper
Using symbolic calculations to determine largest small polygons2021-08-17Paper
On the nullity number of graphs2021-08-16Paper
A relation between proximity and the third largest distance eigenvalue of a graph2021-03-25Paper
On the difference of energies of a graph and its complement graph2020-03-20Paper
Cospectrality of graphs with respect to distance matrices2019-12-12Paper
Integral simplex using double decomposition for set partitioning problems2019-09-25Paper
https://portal.mardi4nfdi.de/entity/Q53790952019-05-28Paper
Adding cohesion constraints to models for modularity maximization in networks2018-10-16Paper
Proximity, remoteness and girth in graphs2018-09-25Paper
A short discussion of the OR crisis2018-07-19Paper
Variable neighborhood search: basics and variants2018-03-28Paper
New VNP for automatic programming2018-01-04Paper
The geometric-arithmetic index and the chromatic number of connected graphs2017-10-17Paper
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem2017-07-13Paper
A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering2017-06-26Paper
Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach2016-11-10Paper
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows2016-11-10Paper
Proximity, remoteness and distance eigenvalues of a graph2016-09-12Paper
https://portal.mardi4nfdi.de/entity/Q28160962016-07-01Paper
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization2016-05-27Paper
Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering2016-05-25Paper
On the distance signless Laplacian of a graph2016-05-12Paper
Identification of all steady states in large networks by logical analysis2016-03-08Paper
Community detection with the weighted parsimony criterion2016-01-14Paper
New heuristic for harmonic means clustering2015-10-28Paper
A reliable affine relaxation method for global optimization2015-09-17Paper
Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering2015-07-23Paper
A note on bimatrix game maximal Selten subsets2015-02-06Paper
Some properties of the distance Laplacian eigenvalues of a graph2015-01-27Paper
Reformulation of a model for hierarchical divisive graph modularity maximization2015-01-22Paper
Column generation bounds for numerical microaggregation2015-01-15Paper
Open problems on graph eigenvalues studied with AutoGraphiX2014-09-30Paper
Automated generation of conjectures on forbidden subgraph characterization2014-09-12Paper
Improving heuristics for network modularity maximization using an exact algorithm2014-09-08Paper
Distance spectra of graphs: a survey2014-07-22Paper
On the Weber facility location problem with limited distances and side constraints2014-04-30Paper
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization2014-04-30Paper
https://portal.mardi4nfdi.de/entity/Q54126342014-04-25Paper
Two Laplacians for the distance matrix of a graph2014-01-21Paper
https://portal.mardi4nfdi.de/entity/Q28615692013-11-08Paper
https://portal.mardi4nfdi.de/entity/Q28566902013-10-30Paper
Sequential clustering with radius and split criteria2013-07-08Paper
https://portal.mardi4nfdi.de/entity/Q28378312013-07-05Paper
https://portal.mardi4nfdi.de/entity/Q52989372013-06-25Paper
https://portal.mardi4nfdi.de/entity/Q52993982013-06-25Paper
https://portal.mardi4nfdi.de/entity/Q49249812013-06-10Paper
A separable approximation dynamic programming algorithm for economic dispatch with transmission losses2013-06-10Paper
On some interconnections between combinatorial optimization and extremal graph theory2013-06-10Paper
https://portal.mardi4nfdi.de/entity/Q49282162013-06-10Paper
The small octagons of maximal width2013-06-07Paper
On proper refinement of Nash equilibria for bimatrix games2013-03-12Paper
A survey of Nordhaus-Gaddum type relations2013-03-12Paper
On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square2012-11-22Paper
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression2012-11-15Paper
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem2012-06-18Paper
Improving constrained pattern mining with first-fail-based heuristics2012-04-11Paper
Maximizing edge-ratio is NP-complete2012-03-19Paper
An improved column generation algorithm for minimum sum-of-squares clustering2012-02-22Paper
Pooling Problem: Alternate Formulations and Solution Methods2012-02-19Paper
https://portal.mardi4nfdi.de/entity/Q31156912012-02-10Paper
Proximity and remoteness in graphs: Results and conjectures2011-11-21Paper
A new column generation algorithm for logical analysis of data2011-11-17Paper
Using size for bounding expressions of graph invariants2011-11-17Paper
Variable neighborhood search for harmonic means clustering2011-08-28Paper
On the extremal values of the second largest \(Q\)-eigenvalue2011-07-13Paper
Remarks on solutions to a nonconvex quadratic programming test problem2011-06-03Paper
Locating Objects in the Plane Using Global Optimization Techniques2011-04-27Paper
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering2011-03-14Paper
The small hexagon and heptagon with maximum sum of distances between vertices2011-03-14Paper
A note on diameters of point sets2010-10-29Paper
On a conjecture about the Szeged index2010-10-18Paper
Nordhaus-Gaddum relations for proximity and remoteness in graphs2010-08-26Paper
Attraction probabilities in variable neighborhood search2010-08-23Paper
A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES2010-05-19Paper
Bounds and conjectures for the signless Laplacian index of graphs2010-05-11Paper
Variable neighbourhood search: methods and applications2010-05-10Paper
Bounds on the index of the signless Laplacian of a graph2010-05-05Paper
A sharp upper bound on algebraic connectivity using domination number2010-04-29Paper
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance2010-04-28Paper
A survey of automated conjectures in spectral graph theory2010-04-06Paper
Merging the local and global approaches to probabilistic satisfiability2010-03-18Paper
Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number2009-12-10Paper
Exact and heuristic solutions of the global supply chain problem with transfer pricing2009-11-27Paper
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille2009-11-12Paper
A restarted and modified simplex search for unconstrained optimization2009-08-14Paper
Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index2009-08-03Paper
https://portal.mardi4nfdi.de/entity/Q53241972009-08-03Paper
Variable neighbourhood search: Methods and applications2009-07-13Paper
An Oil Pipeline Design Problem2009-07-05Paper
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem2009-06-23Paper
Simple polygons of maximum perimeter contained in a unit disk2009-05-13Paper
Algorithms for \(\ell_{1}\)-embeddability and related problems2009-05-08Paper
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results2009-05-07Paper
Using stable sets to bound the chromatic number2009-04-28Paper
NP-hardness of Euclidean sum-of-squares clustering2009-03-31Paper
Isoperimetric polygons of maximum width2009-03-24Paper
Average distance and maximum induced forest2009-02-20Paper
https://portal.mardi4nfdi.de/entity/Q35988732009-02-03Paper
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number2008-11-19Paper
Exact \(L_{2}\)-norm plane separation2008-09-04Paper
The maximum return-on-investment plant location problem with market share2008-07-29Paper
Variable neighborhood search for minimum cost berth allocation2008-07-10Paper
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph2008-07-10Paper
https://portal.mardi4nfdi.de/entity/Q34979172008-05-28Paper
On bags and bugs2008-04-16Paper
https://portal.mardi4nfdi.de/entity/Q54543942008-03-28Paper
On the spectral radius of graphs with a given domination number2008-03-26Paper
Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille2008-02-11Paper
Arbitrary-norm hyperplane separation by variable neighbourhood search2007-12-18Paper
Variable neighbourhood search for colour image quantization2007-12-18Paper
On pitfalls in computing the geodetic number of a graph2007-12-06Paper
Decomposition strategies for large-scale continuous location–allocation problems2007-11-27Paper
Extremal problems for convex polygons2007-11-14Paper
Comparison between Baumann and admissible simplex forms in interval analysis2007-09-10Paper
AutoGraphiX: a survey2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396702007-05-29Paper
Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games2007-03-06Paper
https://portal.mardi4nfdi.de/entity/Q34247662007-03-05Paper
Parallel Variable Neighborhood Search2007-03-05Paper
On a conjecture about the Randić index2007-02-13Paper
The \(p\)-median problem: a survey of metaheuristic approaches2007-02-12Paper
A note on duality gap in the simple plant location problem2007-01-09Paper
The small octagon with longest perimeter2006-12-14Paper
https://portal.mardi4nfdi.de/entity/Q54925332006-10-13Paper
https://portal.mardi4nfdi.de/entity/Q54779622006-06-29Paper
https://portal.mardi4nfdi.de/entity/Q54779632006-06-29Paper
https://portal.mardi4nfdi.de/entity/Q54779642006-06-29Paper
Variable neighborhood search and local branching2006-05-16Paper
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs2006-04-28Paper
First vs. best improvement: an empirical study2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q33776882006-03-28Paper
Heuristic procedures for solving the discrete ordered median problem2006-03-09Paper
Variations on the Roy-Gallai theorem2006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q33690522006-02-13Paper
Integral complete split graphs2006-02-13Paper
https://portal.mardi4nfdi.de/entity/Q57179502006-01-13Paper
PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS2005-11-21Paper
On uniform \(k\)-partition problems2005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q46692292005-04-15Paper
On the geometry of Nash equilibria and correlated equilibria2005-03-11Paper
Maximum split clustering under connectivity constraints2005-02-11Paper
Variable neighborhood search for the maximum clique2005-01-31Paper
Improving interval analysis bounds by translations2004-11-22Paper
An exact method for fractional goal programming2004-11-22Paper
The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal2004-10-14Paper
A note on reduction of quadratic and bilinear programs with equality constraints2004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44646562004-05-27Paper
Chemical trees enumeration algorithms2004-05-18Paper
Variable Neighborhood Search2004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44515072004-02-26Paper
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures2004-02-14Paper
https://portal.mardi4nfdi.de/entity/Q44349882003-11-26Paper
Solving thep-Center problem with Tabu Search and Variable Neighborhood Search2003-08-20Paper
J-MEANS: A new local search heuristic for minimum sum of squares clustering2003-06-03Paper
A constructive enumeration of fusenes and benzenoids2003-05-14Paper
Extension of Turán's theorem to the 2-stability number2003-03-25Paper
Maximizing the Product of Two Linear Functions In 0-1 Variables2003-03-04Paper
Fuzzy J-means: a new heuristic for fuzzy clustering2003-02-20Paper
Computers and discovery in algebraic graph theory2003-02-05Paper
Variable neighborhood decomposition search2002-12-15Paper
The maximum capture problem with random utilities: problem formulation and algorithms2002-11-20Paper
The largest small octagon2002-10-17Paper
Probabilistic satisfiability with imprecise probabilities2002-07-23Paper
https://portal.mardi4nfdi.de/entity/Q27765692002-07-08Paper
Boundary uniqueness of fusenes2002-06-24Paper
https://portal.mardi4nfdi.de/entity/Q45294492002-06-05Paper
https://portal.mardi4nfdi.de/entity/Q44952032002-06-02Paper
Polynomial algorithms for nested univariate clustering2002-05-15Paper
Enumeration of All Extreme Equilibria of Bimatrix Games2002-04-15Paper
Variable neighborhood search: Principles and applications2002-03-24Paper
Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming2002-02-07Paper
The Assignment Problem with Seniority and Job Priority Constraints2002-02-07Paper
Variable neighborhood search for extremal graphs 32002-01-27Paper
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27247442001-08-16Paper
New algorithms for product positioning2001-02-22Paper
A symmetrical linear maxmin approach to disjoint bilinear programming2000-11-12Paper
Variable neighborhood search for extremal graphs. I: The AutoGraphiX system2000-11-08Paper
https://portal.mardi4nfdi.de/entity/Q45110222000-10-30Paper
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering2000-10-19Paper
https://portal.mardi4nfdi.de/entity/Q44932562000-08-03Paper
On lower bounds for numbered complete graphs2000-07-25Paper
https://portal.mardi4nfdi.de/entity/Q49344022000-07-05Paper
NASH EQUILIBRIA FROM THE CORRELATED EQUILIBRIA VIEWPOINT2000-06-19Paper
Best second order bounds for two-terminal network reliability with dependent edge failures2000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27521292000-01-01Paper
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem1999-11-14Paper
https://portal.mardi4nfdi.de/entity/Q42474311999-10-31Paper
Stabilized column generation1999-08-09Paper
Variable neighborhood search for the p-median1999-03-01Paper
The profit-maximizing weber problem1999-02-22Paper
An algorithm for Weber's problem on the sphere1999-02-22Paper
Minimum sum of squares clustering in a low dimensional space1998-12-14Paper
Heuristic solution of the multisource Weber problem as a \(p\)-median problem1998-11-15Paper
https://portal.mardi4nfdi.de/entity/Q43949841998-08-12Paper
https://portal.mardi4nfdi.de/entity/Q43946011998-06-11Paper
Paths with minimum range and ratio of arc lengths1998-06-11Paper
Cluster analysis and mathematical programming1998-05-25Paper
Links between linear bilevel and mixed 0-1 programming problems1998-03-05Paper
https://portal.mardi4nfdi.de/entity/Q43757441998-03-02Paper
Perfect matchings and ears in elementary bipartite graphs1998-01-26Paper
Variable neighborhood search1997-12-02Paper
Splitting trees1997-10-08Paper
Mixed graph colorings1997-08-26Paper
Boolean query optimization and the 0-1 hyperbolic sum problem1997-07-20Paper
Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems1997-07-14Paper
Espaliers: A generalization of dendrograms1997-03-18Paper
https://portal.mardi4nfdi.de/entity/Q52840541997-02-04Paper
Shortest shortest path trees of a network1996-11-21Paper
https://portal.mardi4nfdi.de/entity/Q48791901996-09-24Paper
Heuristic reliability optimization by tabu search1996-07-28Paper
An Impossibility Result in Axiomatic Location Theory1996-06-23Paper
Complexity of Product Positioning and Ball Intersection Problems1996-06-09Paper
Boole's conditions of possible experience and reasoning under uncertainty1996-04-15Paper
https://portal.mardi4nfdi.de/entity/Q48673191996-02-28Paper
https://portal.mardi4nfdi.de/entity/Q48673201996-02-28Paper
https://portal.mardi4nfdi.de/entity/Q43269211995-06-06Paper
Assigning a kekulé structure to a conjugated molecule1995-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48338101995-05-23Paper
https://portal.mardi4nfdi.de/entity/Q43219571995-05-11Paper
https://portal.mardi4nfdi.de/entity/Q43269191995-03-27Paper
Modelling location and sizing of offshore platforms1995-02-20Paper
Finding maximum likelihood estimators for the three-parameter Weibull distribution1995-02-09Paper
https://portal.mardi4nfdi.de/entity/Q43020771995-01-15Paper
Cord-slope form of Taylor's expansion in univariate global optimization1994-10-27Paper
A linear algorithm for perfect matching in hexagonal systems1994-03-01Paper
Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions1994-01-13Paper
Bounded vertex colorings of graphs1993-12-20Paper
State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming1993-09-16Paper
Sharp bounds on the order, size, and stability number of graphs1993-09-05Paper
https://portal.mardi4nfdi.de/entity/Q46973321993-06-29Paper
Column Generation Methods for Probabilistic Logic1993-02-18Paper
https://portal.mardi4nfdi.de/entity/Q40226661993-01-17Paper
Global optimization of univariate Lipschitz functions. I: Survey and properties1993-01-16Paper
Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison1993-01-16Paper
New Branch-and-Bound Rules for Linear Bilevel Programming1993-01-16Paper
Location and sizing of offshore platforms for oil exploration1992-10-06Paper
Mean-preserving changes in risk with tail-dominance1992-09-27Paper
Reduction of indefinite quadratic programs to bilinear programs1992-08-13Paper
The smallest hard-to-color graph1992-06-28Paper
On-line and off-line vertex enumeration by adjacency lists1992-06-27Paper
An analytical approach to global optimization1992-06-27Paper
Hyperbolic 0-1 programming and query optimization in information retrieval1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39867031992-06-27Paper
On Timonov's algorithm for global optimization of univariate Lipschitz functions1992-06-26Paper
Efficient algorithms for divisive hierarchical clustering with the diameter criterion1992-06-25Paper
From the median to the generalized center1992-06-25Paper
An algorithm for the minimum variance point of a network1992-06-25Paper
The continuous center set of a network1991-01-01Paper
Algorithms for the maximum satisfiability problem1990-01-01Paper
Commuters' Paths with Penalties for Early or Late Arrival Time1990-01-01Paper
The basic algorithm for pseudo-Boolean programming revisited1990-01-01Paper
Optimum departure times for commuters in congested networks1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33486901990-01-01Paper
Uncapacitated Plant Location Under Alternative Spatial Price Policies1990-01-01Paper
Implicit Treatment of “Zero or Range” Constraints in a Model for Minimum Cost Foundry Alloys1989-01-01Paper
The continuousp-median of a network1989-01-01Paper
Global minimization of univariate functions by sequential polynomial approximation1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38353011989-01-01Paper
Sensitivity analysis in multiple objective linear programming: The tolerance approach1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37753391988-01-01Paper
Algorithms for Voting and Competitive Location on a Network1988-01-01Paper
Minimum sum of diameters clustering1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37552061987-01-01Paper
Problème de la bipartition minimale d'un graphe1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30305831987-01-01Paper
Unimodular functions1986-01-01Paper
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities1986-01-01Paper
Efficient points on a network1986-01-01Paper
Equivalence of Solutions to Network Location Problems1986-01-01Paper
Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)1985-01-01Paper
A note on the 'loser wins' game1985-01-01Paper
Uniquely solvable quadratic Boolean equations1985-01-01Paper
The Minisum and Minimax Location Problems Revisited1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36825101984-01-01Paper
Roof duality, complementation and persistency in quadratic 0–1 optimization1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33292231984-01-01Paper
Recognizing sign solvable graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32217751983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33152951983-01-01Paper
An Algorithm for a Constrained Weber Problem1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36595171982-01-01Paper
Deux problèmes d'affectation non linéaires1982-01-01Paper
Vertices Belonging to All or to No Maximum Stable Sets of a Graph1982-01-01Paper
Simple plant location under uniform delivered pricing1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39074071981-01-01Paper
Constrained Location and the Weber-Rawls Problem1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39295091981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33185411981-01-01Paper
An O(m log D) algorithm for shortest paths1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38841371980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38888741980-01-01Paper
Technical Note—Location Theory, Dominance, and Convexity: Some Further Results1980-01-01Paper
Bicriterion Cluster Analysis1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39288431980-01-01Paper
Product selection and space allocation in supermarkets1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38614301979-01-01Paper
Methods of Nonlinear 0-1 Programming1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38693621979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39038951979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38792731978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39531841978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41679271978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41980591978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42001141978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41387501977-01-01Paper
On kernels in strongly connected graphs1977-01-01Paper
A Plant and Warehouse Location Problem1977-01-01Paper
A cascade algorithm for the logical closure of a set of binary relations1976-01-01Paper
Degrees and independent sets of hypergraphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41054481976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41406741976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40629361975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40629401975-01-01Paper
Sequence comparison by dynamic programming1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001181975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41286131975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40488551974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40533911974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40687681974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40832051974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40652851973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44019871973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32146981973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56845041972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56294331971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56294341971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55912461970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56158131970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55780311969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55783081969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56505111969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Pierre Hansen