Sandra M. Hedetniemi

From MaRDI portal
Person:251499

Available identifiers

zbMath Open hedetniemi.sandra-mitchellMaRDI QIDQ251499

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q46041192018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q52674992017-06-13Paper
https://portal.mardi4nfdi.de/entity/Q28118222016-06-10Paper
A Roman domination chain2016-03-02Paper
Analyzing graphs by degrees2014-04-25Paper
SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS2014-04-10Paper
Quorum colorings of graphs2014-04-07Paper
https://portal.mardi4nfdi.de/entity/Q28693482014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q53270702013-08-01Paper
https://portal.mardi4nfdi.de/entity/Q52989052013-06-25Paper
Secondary and internal distances of sets in graphs. II2013-01-03Paper
A self-stabilizing algorithm for optimally efficient sets in graphs2012-10-23Paper
https://portal.mardi4nfdi.de/entity/Q28953542012-07-02Paper
γ-graphs of graphs2011-09-20Paper
Secondary and internal distances of sets in graphs2011-02-08Paper
https://portal.mardi4nfdi.de/entity/Q30702322011-02-02Paper
Matchability and \(k\)-maximal matchings2011-01-14Paper
https://portal.mardi4nfdi.de/entity/Q36355742009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36215352009-04-21Paper
Secondary domination in graphs2009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36157992009-03-24Paper
https://portal.mardi4nfdi.de/entity/Q54883312006-09-14Paper
Domination equivalence in graphs2006-05-09Paper
Broadcasts in graphs2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q46819942005-06-09Paper
Generalized subgraph-restricted matchings in graphs2005-06-01Paper
Offensive alliances in graphs2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q48187952004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48208182004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44702372004-06-22Paper
Roman domination in graphs.2004-03-14Paper
Iterated colorings of graphs.2004-03-14Paper
Domination in Graphs Applied to Electric Power Networks2003-01-05Paper
Domination Subdivision Numbers2002-11-05Paper
On \(k\)-dependent domination2002-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45294952002-05-22Paper
Domination and independence subdivision numbers of graphs2002-03-24Paper
The complexity of approximating MAPs for belief networks with bounded probabilities2000-12-12Paper
Irredundant and perfect neighbourhood sets in trees2000-11-02Paper
Acyclic domination2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q49339322000-09-05Paper
On perfect neighborhood sets in graphs2000-01-09Paper
Approximating MAPs for belief networks is NP-hard and other theorems1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42117531998-10-07Paper
\(k\)-path partitions in trees1998-06-11Paper
Using maximality and minimality conditions to construct inequality chains1998-05-06Paper
https://portal.mardi4nfdi.de/entity/Q43786271998-03-31Paper
https://portal.mardi4nfdi.de/entity/Q52840911997-02-04Paper
https://portal.mardi4nfdi.de/entity/Q48710331996-05-21Paper
https://portal.mardi4nfdi.de/entity/Q48711691996-05-21Paper
Nearly perfect sets in graphs1995-04-17Paper
A survey of gossiping and broadcasting in communication networks1988-01-01Paper
Interior graphs of maximal outerplane graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33425931985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36935371985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33257491984-01-01Paper
On the Algorithmic Complexity of Total Domination1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419201983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47399461982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47452721982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47506571982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39486061981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39521311981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38955001980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38970721980-01-01Paper
Constant Time Generation of Rooted Trees1980-01-01Paper
Rectilinear Steiner Trees in Rectangle Trees1980-01-01Paper
Linear algorithms for edge-coloring trees and unicyclic graphs1979-01-01Paper
Linear algorithms to recognize outerplanar and maximal outerplanar graphs1979-01-01Paper
Linear algorithms on recursive representations of trees1979-01-01Paper
Minimum broadcast graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38645691979-01-01Paper
Another characterization of the centroid of a tree1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32069691977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38709171977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41233491975-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: Sandra M. Hedetniemi