default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Sonntag
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Martin Sonntag, Hanns-Martin Teichert:
Edge intersection hypergraphs. Discuss. Math. Graph Theory 44(1): 101 (2024)- 2023
- [j27]Martin Sonntag
, Jens Mehmann, Frank Teuteberg:
Trust-Supporting Design Elements as Signals for AI-Based Chatbots in Customer Service: A Behavior-Based Explanatory Model. Int. J. Serv. Sci. Manag. Eng. Technol. 14(1): 1-16 (2023) - [j26]Martin Sonntag, Jens Mehmann, Frank Teuteberg:
Deriving Trust-Supporting Design Knowledge for AI-Based Chatbots in Customer Service: A Use Case From the Automotive Industry. J. Organ. Comput. Electron. Commer. 33(3-4): 178-210 (2023) - 2022
- [c2]Martin Sonntag, Jens Mehmann, Frank Teuteberg:
AI-based Conversational Agents for Customer Service - A Study of Customer Service Representative' Perceptions Using TAM 2. Wirtschaftsinformatik 2022 - 2020
- [j25]Martin Sonntag, Hanns-Martin Teichert:
Niche hypergraphs of products of digraphs. Discuss. Math. Graph Theory 40(1): 279-295 (2020)
2010 – 2019
- 2016
- [j24]Martin Sonntag, Hanns-Martin Teichert:
Product of digraphs and their competition graphs. Discuss. Math. Graph Theory 36(1): 43-58 (2016) - [j23]Christian Garske, Martin Sonntag, Hanns-Martin Teichert:
Niche hypergraphs. Discuss. Math. Graph Theory 36(4): 819-832 (2016) - 2015
- [j22]Martin Sonntag, Hanns-Martin Teichert:
Some Results on Exclusive Sum Labelings of Hypergraphs. Graphs Comb. 31(6): 2401-2412 (2015) - 2013
- [j21]Martin Sonntag, Hanns-Martin Teichert:
Neighborhood structures and products of undirected graphs. Discret. Math. 313(4): 563-574 (2013) - 2012
- [j20]Martin Sonntag, Hanns-Martin Teichert:
Iterated neighborhood graphs. Discuss. Math. Graph Theory 32(3): 403-417 (2012) - 2010
- [j19]Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert:
Structural Properties and Hamiltonicity of Neighborhood Graphs. Graphs Comb. 26(3): 433-456 (2010)
2000 – 2009
- 2009
- [j18]Martin Sonntag, Hanns-Martin Teichert:
Competition Hypergraphs of Products of Digraphs. Graphs Comb. 25(4): 611-624 (2009) - 2008
- [j17]Martin Sonntag, Hanns-Martin Teichert:
Competition hypergraphs of digraphs with certain properties I. Strong connectedness. Discuss. Math. Graph Theory 28(1): 5-21 (2008) - [j16]Martin Sonntag, Hanns-Martin Teichert:
Competition hypergraphs of digraphs with certain properties II. Hamiltonicity. Discuss. Math. Graph Theory 28(1): 23-34 (2008) - 2007
- [j15]Martin Sonntag:
A characterization of hypercacti. Discret. Math. 307(21): 2615-2621 (2007) - 2004
- [j14]Martin Sonntag, Hanns-Martin Teichert:
Competition hypergraphs. Discret. Appl. Math. 143(1-3): 324-329 (2004) - [j13]Martin Sonntag:
Difference labelling of digraphs. Discuss. Math. Graph Theory 24(3): 509-527 (2004) - 2003
- [j12]Martin Sonntag:
Difference labelling of cacti. Discuss. Math. Graph Theory 23(1): 55-65 (2003) - 2002
- [j11]Martin Sonntag:
Antimagic vertex labelings of hypergraphs. Discret. Math. 247(1-3): 187-199 (2002) - 2001
- [j10]Martin Sonntag, Hanns-Martin Teichert:
On the sum number and integral sum number of hypertrees and complete hypergraphs. Discret. Math. 236(1-3): 339-349 (2001) - 2000
- [j9]Martin Sonntag, Hanns-Martin Teichert:
Sum numbers of hypertrees. Discret. Math. 214(1-3): 285-290 (2000)
1990 – 1999
- 1995
- [c1]Randy Kerr, Mike Markley, Martin Sonntag, Tandy Trower:
Reno: a component-based user interface. CHI 95 Conference Companion 1995: 19-20 - 1993
- [j8]Martin Sonntag:
Hamiltonicity of the Disjunction of Two Hypergraphs. J. Inf. Process. Cybern. 29(3): 193-205 (1993) - 1991
- [j7]Martin Sonntag:
Hamiltonicity and Traceability of the Lexicographic Product of Hypergraphs. J. Inf. Process. Cybern. 27(5/6): 289-301 (1991) - [j6]Martin Sonntag:
Corrigendum to: "Hamiltonicity of the Normal Product of Hypergraphs" in: J. Inform. Process. Cybernet. EIK26(1990) 7, 415-433. J. Inf. Process. Cybern. 27(7): 385-386 (1991) - 1990
- [j5]Martin Sonntag:
Hamiltonicity of the Normal Product of Hypergraphs. J. Inf. Process. Cybern. 26(7): 415-433 (1990)
1980 – 1989
- 1989
- [j4]Martin Sonntag:
Hamiltonian Properties of the Cartesian Sum of Hypergraphs. J. Inf. Process. Cybern. 25(3): 87-100 (1989) - 1987
- [j3]Martin Sonntag:
Some Results on Hamiltonian Properties of Products of Digraphs I. t-Hamiltonian Properties and Strong Path-Connectedness. J. Inf. Process. Cybern. 23(4/5): 181-193 (1987) - [j2]Martin Sonntag:
Some Results on Hamitonian Properties of Products of Digraphs II. Pancyclicity Properties. J. Inf. Process. Cybern. 23(7): 323-329 (1987) - 1985
- [j1]Martin Sonntag:
Some Hamiltonian Properties of Products of Digraphs. J. Inf. Process. Cybern. 21(6): 275-282 (1985)
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-07-09 21:11 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:
