default search action
David Hartman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Martin Cerný, Jan Bok, David Hartman
, Milan Hladík:
Positivity and convexity in incomplete cooperative games. Ann. Oper. Res. 340(2): 785-809 (2024) - [j8]David Hartman
On the connectivity and the diameter of betweenness-uniform graphs. Discret. Appl. Math. 342: 27-37 (2024) - 2023
- [i13]Milan Hladík, David Hartman:
Absolute value linear programming. CoRR abs/2307.03510 (2023) - [i12]David Hartman, Tomás Hons, Jaroslav Nesetril:
Structural convergence and algebraic roots. CoRR abs/2310.07045 (2023) - [i11]Anna Pidnebesna, David Hartman, Aneta Pokorná, Matej Straka, Jaroslav Hlinka:
Computing approximate symmetries of complex networks. CoRR abs/2312.08042 (2023) - 2022
- [j7]Dipankar Maity
Sensor scheduling for linear systems: A covariance tracking approach. Autom. 136: 110078 (2022) - [i10]David Hartman, Tomás Hons, Jaroslav Nesetril:
Gadget construction and structural convergence. CoRR abs/2212.10985 (2022) - 2021
- [j6]David Hartman
Computing the spectral decomposition of interval matrices and a study on interval matrix powers. Appl. Math. Comput. 403: 126174 (2021) - [j5]Milan Hladík
Maximization of a PSD quadratic form and factorization. Optim. Lett. 15(7): 2515-2528 (2021) - [c10]David Hartman
On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CALDAM 2021: 317-330 - [i9]David Hartman, Aneta Pokorná:
Constructions of betweenness-uniform graphs from trees. CoRR abs/2105.06777 (2021) - [i8]David Hartman, Aneta Pokorná, Pavel Valtr:
On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CoRR abs/2109.10594 (2021) - [i7]Dipankar Maity, David Hartman, John S. Baras:
Sensor Scheduling for Linear Systems: A Covariance Tracking Approach. CoRR abs/2110.08924 (2021) - 2020
- [j4]Andrés Aranda
The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs. Eur. J. Comb. 85 (2020) - [i6]Jan Bok, Martin Cerný, David Hartman, Milan Hladík:
Convexity and positivity in partially defined cooperative games. CoRR abs/2010.08578 (2020)
2010 – 2019
- 2019
- [c9]David Hartman, John S. Baras:
Near-Optimal Solution to the Non-Uniform Sampling Problem in Kalman Filtering. CDC 2019: 6404-6411 - [c8]Milan Hladík
Maximization of a Convex Quadratic Form on a Polytope: Factorization and the Chebyshev Norm Bounds. WCGO 2019: 119-127 - [i5]David Hartman, Milan Hladík, David Ríha:
Computing the spectral decomposition of interval matrices and a study on interval matrix power. CoRR abs/1912.05275 (2019) - 2018
- [i4]David Hartman, Jaroslav Hlinka:
Nonlinearity in stock networks. CoRR abs/1804.10264 (2018) - [i3]David Hartman, Milan Hladík:
Regularity radius: Properties, approximation and a not a priori exponential algorithm. CoRR abs/1806.09988 (2018) - 2017
- [c7]David Hartman, Lalit K. Mestha:
A deep learning framework for model reduction of dynamical systems. CCTA 2017: 1917-1922 - 2015
- [c6]George Feuerlicht, David Hartman
Estimating the Complexity of Software Services Using an Entropy Based Metric. ICSOC Workshops 2015: 15-23 - [c5]George Feuerlicht, Vladimír Kovár, David Hartman, Marek Beránek, Pavel Bory:
Measuring Complexity of Domain Standard Specifications Using XML Schema Entropy. SOFSEM (Student Research Forum Papers / Posters) 2015: 124-131 - 2014
- [j3]David Hartman
Homomorphism-homogeneous LL-colored graphs. Eur. J. Comb. 35: 313-323 (2014) - [c4]David Hartman
Tight Bounds on the Radius of Nonsingularity. SCAN 2014: 109-115 - 2013
- [j2]Jaroslav Hlinka
Reliability of Inference of Directed Climate Networks Using Conditional Mutual Information. Entropy 15(6): 2023-2045 (2013) - [i2]David Hartman, Jan Hubicka, Jaroslav Nesetril:
Complexities of relational structures. CoRR abs/1309.4266 (2013) - 2012
- [i1]Jaroslav Hlinka, David Hartman, Milan Palus:
Small-world topology of functional connectivity in randomly connected dynamical systems. CoRR abs/1206.3963 (2012) - 2011
- [j1]David Hartman
Towards finite homomorphism-homogeneous relational structures. Electron. Notes Discret. Math. 38: 443-448 (2011)
2000 – 2009
- 2007
- [c3]Zhenbiao Li, Wenhai Ni, Jie Ma, Ming Li, Dequn Ma, Dong Zhao, Jesal Mehta, David Hartman, Xianfeng Wang, Ken K. O, Kai Che:
A Dual-Band CMOS Transceiver for 3G TD-SCDMA. ISSCC 2007: 344-607 - 2006
- [c2]Wendy F. Cohn, Aaron Pannone, Jane R. Schubart, Jason A. Lyman, Mable B. Kinzie, Donna K. Broshek, Thomas M. Guterbock, David Hartman, David Mick, Armando Bolmey, Arthur T. Garson:
Tailored Educational Approaches for Consumer Health (TEACH): A Model System for Addressing Health Communication. AMIA 2006 - 2003
- [c1]David Hartman, Jaroslav Kaccer:
JUTS: J-sim urban traffic simulator. PPPJ 2003: 113
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-12-10 20:49 CET 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: