The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Minor with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1976 (15) 1977-1983 (16) 1984-1986 (17) 1987-1988 (21) 1989-1990 (42) 1991-1992 (33) 1993 (15) 1994 (17) 1995 (22) 1996 (24) 1997 (35) 1998 (48) 1999 (54) 2000 (66) 2001 (58) 2002 (98) 2003 (96) 2004 (133) 2005 (172) 2006 (168) 2007 (209) 2008 (205) 2009 (147) 2010 (70) 2011 (45) 2012 (56) 2013 (43) 2014 (59) 2015 (47) 2016 (60) 2017 (57) 2018 (70) 2019 (86) 2020 (94) 2021 (78) 2022 (75) 2023 (85) 2024 (24)
Publication types (Num. hits)
article(1133) book(2) data(1) incollection(8) inproceedings(1507) phdthesis(4) proceedings(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1413 occurrences of 1149 keywords

Results
Found 2713 publication records. Showing 2660 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
144Ken-ichi Kawarabayashi, Bojan Mohar Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring
118Ken-ichi Kawarabayashi Half integral packing, Erdős-Posá-property and graph minors. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
105Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs
105Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
104Isolde Adler, Martin Grohe, Stephan Kreutzer Computing excluded minors. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
88Austin A. Lobo, Susan A. Vowels Information systems at a liberal arts college: an interdisciplinary minor. Search on Bibsonomy CPR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF information systems minor, interdisciplinary, program development, information systems education, minor, liberal arts
69Ken-ichi Kawarabayashi, Bruce A. Reed Odd cycle packing. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF odd cycle, packing
63Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
63Anuj Dawar, Martin Grohe, Stephan Kreutzer Locally Excluding a Minor. Search on Bibsonomy LICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
63Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF (k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
63Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
61Costas Busch, Ryan LaFortune, Srikanta Tirthapura Improved sparse covers for graphs excluding a fixed minor. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF minor free graph, path separator, sparse cover, planar graph, compact routing
56Leif K. Jørgensen Vertex Partitions of K4, 4-Minor Free Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
54Shai Gutner Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel
54Mark Stockman, Soleda Leung, John Nyland, Hazem Said The information technology minor: filling a need in the workforce of today. Search on Bibsonomy SIGITE Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF curriculum, information technology education, minor, information technology profession
49Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
49Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi Additive approximation algorithms for list-coloring minor-closed class of graphs. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49Mao Ye 0001, Yongguo Liu, Hong Wu, Qihe Liu A few online algorithms for extracting minor generalized eigenvectors. Search on Bibsonomy IJCNN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
48Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach Spanners in Sparse Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
48Erik D. Demaine, Mohammad Taghi Hajiaghayi Equivalence of local treewidth and linear local treewidth and its algorithmic applications. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
48Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder Strong-diameter decompositions of minor free graphs. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF minor free graphs, compact routing
48Petr Hlinený On Matroid Representability and Minor Problems. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Matroid representability, spike, swirl. 2000 Math subject classification: 05B35, finite field, 68Q17, 68R05, minor
42Avner Magen, Mohammad Moharrami Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
42Siamak Tazari, Matthias Müller-Hannemann A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Bruce A. Reed, Zhentao Li Optimization and Recognition for K 5-minor Free Graphs in Linear Time. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Erik D. Demaine, Mohammad Taghi Hajiaghayi Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
42Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
42Glenn S. Dardick, Linda K. Lau Interdisciplinary minor in digital forensics, security and law. Search on Bibsonomy SIGITE Conference The full citation details ... 2005 DBLP  DOI  BibTeX  RDF cyberlaw, electronic evidence, curriculum, digital forensics, computer forensics, digital evidence
42Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
42Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Bidimensional Parameters and Local Treewidth. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
42Michele Kleckner Where writing and rhetoric meet multimedia production designing an effective, interdisciplinary capstone experience. Search on Bibsonomy SIGITE Conference The full citation details ... 2004 DBLP  DOI  BibTeX  RDF co-taught, multimedia, curriculum, interdisciplinary, capstone course, capstone project
41Itai Benjamini, Oded Schramm, Asaf Shapira Every minor-closed property of sparse graphs is testable. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minor closed properties, graph algorithms, property testing
41Karim Abed-Meraim, Ammar Chkeif, Yingbo Hua, Samir Attallah On a Class of Orthonormal Algorithms for Principal and Minor Subspace Tracking. Search on Bibsonomy J. VLSI Signal Process. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF orthonormality, principal & minor component analysis, subspace tracking, adaptive algorithm
40Noga Alon, Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms
40Noga Alon, Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms
40Michelangelo Grigni Approximate TSP in Graphs with Forbidden Minors. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF TSP, separator, spanner, approximation scheme, graph minor, genus
39Arvind Gupta, Russell Impagliazzo Computing Planar Intertwines Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF minor closed graph families, graph family obstructions, planar intertwines, minor ordering
35Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos Catalan structures and dynamic programming in H-minor-free graphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
35Russel Bruhn, Steven F. Jennings A multidisciplinary bioinformatics minor. Search on Bibsonomy SIGCSE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF bioinformatics, computational science, curriculum issues
35Orlando Lee, Aaron Williams Packing Dicycle Covers in Planar Graphs with No K5-e Minor. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Douglas E. Carroll, Ashish Goel Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos Finding Smallest Supertrees Under Minor Containment. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Gian Carlo Bongiovanni, C. K. Wong Tree Search in Major/Minor Loop Magnetic Bubble Memories. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1981 DBLP  DOI  BibTeX  RDF major loops, minor loops, number of comparisons, one-sided height-balanced trees, one-sided K-height-balanced trees, record movement, Analysis of algorithms, insertion, deletion, tree search, balanced trees, magnetic bubble memories
33Andreas Jakoby, Till Tantau Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
33Marco A. Panduro, Carlos A. Brizuela, David Covarrubias, Claudio Lopez A trade-off curve computation for linear antenna arrays using an evolutionary multi-objective approach. Search on Bibsonomy Soft Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Non-regular arrays, Minor lobes, Radiation pattern, Genetic algorithms, Multi-objective
33Margit Kristensen, Morten Kyng, Leysia Palen Participatory design in emergency medical service: designing for future practice. Search on Bibsonomy CHI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Future Lab, major incidents, medical response, minor incidents, victim as boundary object, wireless biomonitor, participatory design, emergency response, technology design
29Wenyan Jia, Shuai Kou, Weihua Yang, Chengfu Qin A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs. Search on Bibsonomy J. Interconnect. Networks The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
29Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001 Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
29Laurent Beaudou, Florent Foucaud, Reza Naserasr Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
29Mikhail I. Ostrovskii, David Rosenthal Metric dimensions of minor excluded graphs and minor exclusion in groups. Search on Bibsonomy Int. J. Algebra Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
29Tingting Zhu, Baoyindureng Wu Domination of maximal K4-minor free graphs and maximal K2, 3-minor free graphs, and disproofs of two conjectures on planar graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
29Christian Wulff-Nilsen Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
29Vicky Choi Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design. Search on Bibsonomy Quantum Inf. Process. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
29Christian Wulff-Nilsen Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
29T. Hugh Crawford Minor houses/minor architecture. Search on Bibsonomy AI Soc. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
29Vicky Choi Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
29Siamak Tazari Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
29Siamak Tazari Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
29Drago Bokal, Gasper Fijavz, David R. Wood The Minor Crossing Number of Graphs with an Excluded Minor. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2008 DBLP  BibTeX  RDF
29Marko V. Jankovic, Branimir Reljin A new minor component analysis method based on Douglas-Kung-Amari minor subspace analysis method. Search on Bibsonomy IEEE Signal Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Manoel Lemos, James G. Oxley On the minor-minimal 2-connected graphs having a fixed minor. Search on Bibsonomy Discret. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Manoel Lemos, James G. Oxley On the minor-minimal 3-connected matroids having a fixed minor. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
29Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
29Robert E. Bixby, Collette R. Coullard Finding a small 3-connected minor maintaining a fixed minor and a fixed element. Search on Bibsonomy Comb. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
28Qian-Ping Gu, Hisao Tamaki Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Graph algorithms, graph minors, branch-decompositions
28Roland Badeau, Gaël Richard, Bertrand David 0002 Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Da-Zheng Feng, Wei Xing Zheng 0001 An Approximate Inverse-Power Algorithm for Adaptive Extraction of Minor Subspace. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Raphael Yuster, Uri Zwick Maximum matching in graphs with an excluded minor. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
28David R. Wood, Jan Arne Telle Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Search on Bibsonomy GD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Ken-ichi Kawarabayashi, Bjarne Toft Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C15, 05C83
28Ittai Abraham, Cyril Gavoille, Dahlia Malkhi Compact Routing for Graphs Excluding a Fixed Minor. Search on Bibsonomy DISC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Mohammed A. Hasan Natural gradient for minor component extraction. Search on Bibsonomy ISCAS (5) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Frank Recker Stochastic Analysis of the Traffic Confluence at the Crossing of a Major and a Minor Road. Search on Bibsonomy OR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF V-ergodic Markov chain, Stopping time, Traffic problems, Queuing theory, Renewal process, Poisson process
28Bin Li 0053, Kuanquan Wang, David Zhang 0001 On-Line Signature Verification Based on PCA (Principal Component Analysis) and MCA (Minor Component Analysis). Search on Bibsonomy ICBA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Jittat Fakcharoenphol, Kunal Talwar An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Jens Gustedt Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF parallel algorithms, graph algorithms, minimum spanning tree, graph minors
28Ken-ichi Kawarabayashi, Bruce A. Reed A nearly linear time algorithm for the half integral parity disjoint paths packing problem. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Robin Thomas 0001 Kt Minors in Large t-Connected Graphs. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Ken-ichi Kawarabayashi, Bruce A. Reed Hadwiger's conjecture is decidable. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hadwiger's conjecture, the four color theorem
28Michael R. Fellows, Danny Hermelin, Frances A. Rosamond Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Jen-Tzung Chien, Chuan-Wei Ting Factor Analyzed Subspace Modeling and Selection. Search on Bibsonomy IEEE Trans. Speech Audio Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Jian-Xun Chen, Bingchiang Jeng, Wen-Shyong Tzou The Impact of Data Deviation in Inferring a Biological Dynamic System. Search on Bibsonomy FSKD (4) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Erik D. Demaine Algorithmic Graph Minors and Bidimensionality. Search on Bibsonomy IWPEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001 Degree-Constrained Subgraph Problems: Hardness and Approximation Results. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
26Ittai Abraham, Cyril Gavoille Object location using path separators. Search on Bibsonomy PODC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF excluded minor, separator, compact routing
26Jaroslav Nesetril, Patrice Ossona de Mendez Linear time low tree-width partitions and algorithmic consequences. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor
26Ruoming Jin, Chao Wang 0050, Dmitrii Polshakov, Srinivasan Parthasarathy 0001, Gagan Agrawal Discovering frequent topological structures from graph datasets. Search on Bibsonomy KDD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF frequent graph pattern, topological minor, graph mining
26Qiang Li, Yasuo Yoshida, Nobuyuki Nakamori A Multiscale Antidiffusion Approach for Gaussian Blurred Images. Search on Bibsonomy ICIP (2) The full citation details ... 1997 DBLP  DOI  BibTeX  RDF multiscale antidiffusion approach, Gaussian blurred images, diffusion equation, scale space image representation, minor noise, multiscale representation method, antidiffusion time, integration computation, image restoration, image restoration, convolution, image decomposition, computationally efficient algorithm
26Jianqiang Zhuo, Paul W. Oman, Ramkumar V. Pichai, Sujay Sahni Using Relative Complexity To Allocate Resources In Gray-Box Testing Of Object-Oriented Code. Search on Bibsonomy IEEE METRICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF gray box testing, object oriented code, software testing costs, relative complexity metric, software quality assessments, industrial C++ software subsystem, rank order, minor test areas, relative test complexity, reliability, object-oriented programming, resource allocation, maintainability, black box, white box testing, testing engineers
26Ian Carmichael, Vassilios Tzerpos, Richard C. Holt Design maintenance: unexpected architectural interactions (experience report). Search on Bibsonomy ICSM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF unexpected architectural interactions, design maintenance, SoFi tool, design structure extraction, large industrial system, minor implementation decisions, extracted design, intended design recovery, software maintenance, software tools, program compilers, C code
24Kelton Minor, Esteban Moro, Nick Obradovich Adverse weather amplifies social media activity. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Sascha Minor, Vix Kemanji Ketoma, Gerrit Meixner Test automation for augmented reality applications: a development process model and case study. Search on Bibsonomy i-com The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Dorothea Koert, Mirjam Minor (eds.) Joint Proceedings of Workshops, Tutorials and Doctoral Consortium co-located with the 45rd German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19-20, 2022. Search on Bibsonomy KI (Workshops) The full citation details ... 2023 DBLP  BibTeX  RDF
24Daniel Bruneß, Matthias Bay, Christian Schulze 0003, Michael Guckert, Mirjam Minor A Hybrid AI-Based Method for ICD Classification of Medical Documents. Search on Bibsonomy ICIMTH The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Nick Kalsi, Fiona Carroll, Katarzyna Minor, Jon Platts Smart Hospitality: Understanding the 'Green' Challenges of Hotels and How IoT-Based Sustainable Development Could be the Answer. Search on Bibsonomy FICTA (1) The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Marcel Mauri, Ömer Ibrahim Erduran, Thu Pham Dieu Anh, Mirjam Minor Integrating BDI Agents with the MATSim Traffic Simulation for Autonomous Mobility on Demand. Search on Bibsonomy LWDA The full citation details ... 2023 DBLP  BibTeX  RDF
24Nathan Baum, Mark A. Minor Identification and Control of a Soft-Robotic Bladder Towards Impedance-Style Haptic Terrain Display. Search on Bibsonomy IEEE Robotics Autom. Lett. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Zhe Leng, Mark A. Minor The Effect of Sideslip on Jackknife Limits During Low Speed Trailer Operation. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Colin Pollard, Jonathan P. Aston, Mark A. Minor Estimation of Soft Robotic Bladder Compression for Smart Helmets using IR Range Finding and Hall Effect Magnetic Sensing. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Nathan Baum, Mark A. Minor Identification and Control of a Soft-Robotic Bladder Towards Impedance-Style Haptic Terrain Display. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2660 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license