Search results for "minor"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Sten Minör, Boris Magnusson	A Model for Semi-(a)Synchronous Collaborative Editing.	ECSCW	1993	DBLP BibTeX RDF
24	Boris Magnusson, Ulf Asklund, Sten Minör	Fine-Grained Revision Control for Collaborative Software Development.	SIGSOFT FSE	1993	DBLP DOI BibTeX RDF	incremental merge, teamware, version and configuration control, CSCW, software development, group awareness
24	Sten Minör	Interacting with Structure-Oriented Editors.	Int. J. Man Mach. Stud.	1992	DBLP DOI BibTeX RDF
24	Fano Ramparany, Earl Minor	An Architecture for Intelligent User Interfaces.	IFIP Congress (3)	1992	DBLP BibTeX RDF
24	Boris Magnusson, Sten Minör	Environments for Cooperative Software Development.	CSCW Tools and Technologies Workshop	1992	DBLP DOI BibTeX RDF
24	Marc Haziza, J. F. Voidrot, E. Minor, L. Pofelski, Sandrine Blazy	Software maintenance: an analysis of industrial needs and constraints.	ICSM	1992	DBLP DOI BibTeX RDF
24	Sylvaine Le Minor, Paulette Dostatni	A bibliometric study of the publications of the French National Institute for Health and Medical Research (INSERM).	Scientometrics	1991	DBLP DOI BibTeX RDF
24	Anant Agarwal, Minor Huffman	Blocking: Exploiting Spatial Locality for Trace Compaction.	SIGMETRICS	1990	DBLP DOI BibTeX RDF
24	Brigitte Roudaud, Valé Lavigne, Olivier Lagneau, Earl Minor	SCENARIOO: A new generation UIMS.	INTERACT	1990	DBLP BibTeX RDF
24	John Minor Ross	Documentation - the good, the bad and the ugly.	SIGDOC	1988	DBLP DOI BibTeX RDF
24	Boris Magnusson, Sten Minör	III - an integrated interactive incremental programming environment based on compilation.	SIGSMALL	1985	DBLP DOI BibTeX RDF
24	Sten Minör, Per-Olov Nilsson	Using a personal computer as a debug engine.	SIGSMALL	1983	DBLP DOI BibTeX RDF
24	Lewis G. Minor, Jack Sklansky	The Detection and Segmentation of Blobs in Infrared Images.	IEEE Trans. Syst. Man Cybern.	1981	DBLP DOI BibTeX RDF
21	James R. Lee, Anastasios Sidiropoulos	On the geometry of graphs with a forbidden minor.	STOC	2009	DBLP DOI BibTeX RDF	forbidden minors, geometry of graphs, embeddings
21	Salil Joshi 0002, Barbara König 0001	Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems.	CAV	2008	DBLP DOI BibTeX RDF
21	Mohammed A. Hasan	Dual systems for minor and principal component computation.	ICASSP	2008	DBLP DOI BibTeX RDF
21	Mohammed A. Hasan	Joint computation of principal and minor components using gradient dynamical systems over stiefel manifolds.	CDC	2008	DBLP DOI BibTeX RDF
21	Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach	A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.	MFCS	2008	DBLP DOI BibTeX RDF
21	Markus Chimani, Carsten Gutwenger	Algorithms for the Hypergraph and the Minor Crossing Number Problems.	ISAAC	2007	DBLP DOI BibTeX RDF
21	Andrzej Czygrinow, Michal Hanckowiak	Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.	COCOON	2007	DBLP DOI BibTeX RDF
21	Andrzej Czygrinow, Michal Hanckowiak	Distributed Almost Exact Approximations for Minor-Closed Families.	ESA	2006	DBLP DOI BibTeX RDF
21	Roger Xu, Guangfan Zhang, Xiaodong Zhang 0004, Leonard Haynes, Chiman Kwan, Kenneth Semega	Sensor Validation Using Nonlinear Minor Component Analysis.	ISNN (2)	2006	DBLP DOI BibTeX RDF
21	Donghai Li, Shihai Gao, Feng Wang, Fankun Meng	Direction of Arrival Estimation Based on Minor Component Analysis Approach.	ICONIP (2)	2006	DBLP DOI BibTeX RDF
21	Vanessa Yaremchuk, Michael R. W. Dawson	Chord Classifications by Artificial Neural Networks Revisited: Internal Representations of Circles of Major Thirds and Minor Thirds.	ICANN (1)	2005	DBLP DOI BibTeX RDF
21	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Diameter and Treewidth in Minor-Closed Graph Families, Revisited.	Algorithmica	2004	DBLP DOI BibTeX RDF	Apex graphs, Bounded local treewidth, Approximation algorithms, Graph algorithms, Graph minors
21	Mohammed A. Hasan	Algorithms for computating principal and minor invariant subspaces of large matrices.	ISCAS (5)	2003	DBLP DOI BibTeX RDF
21	Brendan Wallace, Alastair Ross, John B. Davies, Linda Wright, Mathew White	The Creation of a New Minor Event Coding System.	Cogn. Technol. Work.	2002	DBLP DOI BibTeX RDF	Human factors -‘Near-miss reporting’, Error detection, Error analysis
21	Mohammed A. Hasan, Ali A. Hasan	Minor and major subspace computation of large matrices.	ISCAS (4)	2002	DBLP DOI BibTeX RDF
21	David Eppstein	Diameter and Treewidth in Minor-Closed Graph Families.	Algorithmica	2000	DBLP DOI BibTeX RDF
21	Anisse Taleb, Giansalvo Cirrincione	Against the convergence of the minor component analysis neurons.	IEEE Trans. Neural Networks	1999	DBLP DOI BibTeX RDF
21	Rudi Pendavingh	On the Relation Between Two Minor-Monotone Graph Parameters.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C
21	Anne Bottreau, Yves Métivier	Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling.	FoSSaCS	1998	DBLP DOI BibTeX RDF
21	Arvind Gupta	Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract).	ICALP	1993	DBLP DOI BibTeX RDF
21	Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff	Transitive-closure spanners.	SODA	2009	DBLP DOI BibTeX RDF
21	Peter De Baer, Robert Meersman, Gang Zhao 0001	An Evolutionary Ontology Approach for Community-Based Competency Management.	OTM Workshops	2009	DBLP DOI BibTeX RDF	Evolutionary ontology, competence ontology, human resource management, competency management
21	Erik D. Demaine, MohammadTaghi Hajiaghayi	Linearity of grid minors in treewidth with applications through bidimensionality.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C83, 68R10, 05C85
21	Punyashloka Biswal, James R. Lee, Satish Rao	Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.	FOCS	2008	DBLP DOI BibTeX RDF
21	Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood	Improved upper bounds on the crossing number.	SCG	2008	DBLP DOI BibTeX RDF	convex crossing number, rectilinear crossing number, graph drawing, treewidth, crossing number, graph minors, pathwidth, maximum degree
21	Aquinas Hobor, Andrew W. Appel, Francesco Zappa Nardelli	Oracle Semantics for Concurrent Separation Logic.	ESOP	2008	DBLP DOI BibTeX RDF
21	Dezhong Peng, Zhang Yi 0001	Dynamics of Generalized PCA and MCA Learning Algorithms.	IEEE Trans. Neural Networks	2007	DBLP DOI BibTeX RDF
21	Majid Beigi, Andreas Zell	Synthetic Protein Sequence Oversampling Method for Classification and Remote Homology Detection in Imbalanced Protein Data.	BIRD	2007	DBLP DOI BibTeX RDF
21	U. K. S. Jayarathna, G. E. M. D. C. Bandara	A Junction Based Segmentation Algorithm for Offline Handwritten Connected Character Segmentation.	CIMCA/IAWTIC	2006	DBLP DOI BibTeX RDF	Connected digit Strings, Skeletonization, Fuzzy Rules, Binarization
21	Majid Beigi, Andreas Zell	SPSO: Synthetic Protein Sequence Oversampling for Imbalanced Protein Data and Remote Homology Detection.	ISBMDA	2006	DBLP DOI BibTeX RDF
21	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.	Algorithmica	2005	DBLP DOI BibTeX RDF	Subexponential algorithms, Dominating set, Graph minors
21	David Eppstein	All maximal independent sets and dynamic dominance for sparse graphs.	SODA	2005	DBLP BibTeX RDF
21	Dezhong Peng, Zhang Yi 0001, XiaoLin Xiang	A Modified MCA EXIN Algorithm and Its Convergence Analysis.	ISNN (1)	2005	DBLP DOI BibTeX RDF
21	Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee	Improved approximation algorithms for minimum-weight vertex separators.	STOC	2005	DBLP DOI BibTeX RDF	vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
21	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	The Bidimensional Theory of Bounded-Genus Graphs.	MFCS	2004	DBLP DOI BibTeX RDF
21	Sofiane Gasmi, C. Ernie Love, Waltraud Kahle	A general repair, proportional-hazards, framework to model complex repairable systems.	IEEE Trans. Reliab.	2003	DBLP DOI BibTeX RDF
21	Michelangelo Grigni, Papa A. Sissokho	Light spanners and approximate TSP in weighted graphs with forbidden minors.	SODA	2002	DBLP BibTeX RDF
21	Andreas Jakoby, Maciej Liskiewicz	Paths Problems in Symmetric Logarithmic Space.	ICALP	2002	DBLP DOI BibTeX RDF
21	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.	WADS	2001	DBLP DOI BibTeX RDF
21	Jens Lagergren	The Size of an Interwine.	ICALP	1994	DBLP DOI BibTeX RDF
19	Martin Grohe	Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors.	LICS	2010	DBLP DOI BibTeX RDF	graph minor theory, fixed-point logic, graph canonisation, descriptive complexity
19	Monica McGill	Collaborative design of cross-disciplinary game minors based on the IGDA curriculum framework.	ITiCSE	2010	DBLP DOI BibTeX RDF	IGDA, education, game, framework, curriculum, game design, game development, interactive media, minor
19	Heping Gao, Meera Sitharam	Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces.	SAC	2009	DBLP DOI BibTeX RDF	Henneberg-I graph, combinatorial rigidity, geometric constraints and reasoning, graph characterization, one degree of freedom (1-dof), quadratic or radical solvability, triangle-decomposable or tree-decomposable graph, underconstrained geometric constraint solving, computer aided design, mechanism, linkage, graph minor, algebraic complexity, configuration space
19	Dave Kell	Student consultant achievement program for training and performance management.	SIGUCCS	2009	DBLP DOI BibTeX RDF	major achievement, master achievement, minor achievement, upgradeable achievement
19	Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster	Treewidth Lower Bounds with Brambles.	Algorithmica	2008	DBLP DOI BibTeX RDF	Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth
19	Nicolas Nisse, Karol Suchan	Fast Robber in Planar Graphs.	WG	2008	DBLP DOI BibTeX RDF	Cops and robber, grid, planar graph, subdivision, minor
19	Yingchao Zhao 0001, Shang-Hua Teng	Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces.	TAMC	2007	DBLP DOI BibTeX RDF	shallow minor, Fiedler value, metric embedding, Doubling dimension, neighborhood system
19	Eno Thereska, Brandon Salmon, John D. Strunk, Matthew Wachs, Michael Abd-El-Malek, Julio César López-Hernández, Gregory R. Ganger	Stardust: tracking activity in a distributed storage system.	SIGMETRICS/Performance	2006	DBLP DOI BibTeX RDF	Ursa Minor, end-to-end tracing, request causal chain
19	Jon M. Kleinberg, Ronitt Rubinfeld	Short Paths in Expander Graphs.	FOCS	1996	DBLP DOI BibTeX RDF	inter-connection networks, disjoint paths problem, graph minor containment, polylogarithmic approximation, routing algorithms, greedy algorithm, network routing, multicommodity flow, expander graphs
19	Anne Bottreau, Yves Métivier	The Kronecker Product and Local Computations in Graphs.	CAAP	1996	DBLP DOI BibTeX RDF	Cut-edge, Cut-vertex, k-covering, Local computations on graphs, The Kronecker product, Planar, Subgraph, Minor
19	Alok Aggarwal, James K. Park	Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version)	FOCS	1988	DBLP DOI BibTeX RDF	multidimensional monotone arrays, maximum entry, ith row, (i- 1)-st row, totally monotone, 22 subarray, 22 minor, two-dimensional totally monotone arrays, VLSI river routing, dynamic programming, searching, computational geometry, shortest paths, two-dimensional array
19	Noel R. Strader II	Comments on "Magnetic Bubble Memory Architectures for Supporting Associative Searching of Relational Databases".	IEEE Trans. Computers	1982	DBLP DOI BibTeX RDF	bubble memory architecture, major/ minor loops, relational database, Associative retrieval
19	Keith L. Doty, Joel D. Greenblatt, Stanley Y. W. Su	Magnetic Bubble Memory Architectures for Supporting Associative Searching of Relational Databases.	IEEE Trans. Computers	1980	DBLP DOI BibTeX RDF	search time, magnetic bubbles, major/minor loops, memory-scan, information retrieval, relational database, query, memory architectures, associative search, Associative retrieval
19	Dileep Bhandarkar	On the Performance of Magnetic Bubble Memories in Computer Systems.	IEEE Trans. Computers	1975	DBLP DOI BibTeX RDF	magnetic bubbles, major-minor loop, Computer architecture, queueing theory, memory organization
14	Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl	Bipartite graphs with no K6 minor.	J. Comb. Theory, Ser. B	2024	DBLP DOI BibTeX RDF
14	Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht	Excluding a planar matching minor in bipartite graphs.	J. Comb. Theory, Ser. B	2024	DBLP DOI BibTeX RDF
14	Xin Gu, Jinglun Li, Kailong Liu, Yuhao Zhu 0007, Xuewen Tao, Yunlong Shang	A Precise Minor-Fault Diagnosis Method for Lithium-Ion Batteries Based on Phase Plane Sample Entropy.	IEEE Trans. Ind. Electron.	2024	DBLP DOI BibTeX RDF
14	Olivier Fischer, Raphael Steiner	On the choosability of -minor-free graphs.	Comb. Probab. Comput.	2024	DBLP DOI BibTeX RDF
14	Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood	The Excluded Tree Minor Theorem Revisited.	Comb. Probab. Comput.	2024	DBLP DOI BibTeX RDF
14	Meng Yi, Renqian Zhang	Modeling and Solving the Joint Replenishment Problem with Cross-Selling Effects Considering One Shared Minor Item.	Syst.	2024	DBLP DOI BibTeX RDF
14	Emma E. Kim, Chloe Soohyun Jang, Hakin Kim, Buhm Han	PASTRY: achieving balanced power for detecting risk and protective minor alleles in meta-analysis of association studies with overlapping subjects.	BMC Bioinform.	2024	DBLP DOI BibTeX RDF
14	Lyudmila Frishter	Minor and Major Strain: Equations of Equilibrium of a Plane Domain with an Angular Cutout in the Boundary.	Axioms	2024	DBLP DOI BibTeX RDF
14	Florian Lehner	Universal Planar Graphs for the Topological Minor Relation.	Comb.	2024	DBLP DOI BibTeX RDF
14	Shun-ichi Maezawa	A graph minor condition for graphs to be k-linked.	Eur. J. Comb.	2024	DBLP DOI BibTeX RDF
14	Dong Lu, Dingkang Wang, Fanghui Xiao	On Minor Left Prime Factorization Problem for Multivariate Polynomial Matrices.	J. Syst. Sci. Complex.	2024	DBLP DOI BibTeX RDF
14	Inwoo Hwang, Yong-Gu Lee	The identification of minor impact collisions in a long video for detecting property damages caused by fleeing vehicles using three-dimensional convolutional neural network.	J. Comput. Des. Eng.	2024	DBLP DOI BibTeX RDF
14	Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé	Vertex-minor universal graphs for generating entangled quantum subsystems.	CoRR	2024	DBLP DOI BibTeX RDF
14	Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez 0001, Nicolas Trotignon	Detecting K2, 3 as an induced minor.	CoRR	2024	DBLP DOI BibTeX RDF
14	Marcin Brianski, Daniel Král, Kristýna Pekárková	Branch-depth is minor closure of contraction-deletion-depth.	CoRR	2024	DBLP DOI BibTeX RDF
14	Arnold Filtser	On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications.	CoRR	2024	DBLP DOI BibTeX RDF
14	Matthias Hamann	Minor exclusion in quasi-transitive graphs.	Discret. Math.	2024	DBLP DOI BibTeX RDF
14	Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood	The Grid-Minor Theorem Revisited.	SODA	2024	DBLP DOI BibTeX RDF
14	Tuukka Korhonen, Daniel Lokshtanov	Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition.	SODA	2024	DBLP DOI BibTeX RDF
14	Hung Le 0001, Christian Wulff-Nilsen	VC Set Systems in Minor-free (Di)Graphs and Applications.	SODA	2024	DBLP DOI BibTeX RDF
14	Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski 0001	Fully dynamic approximation schemes on planar and apex-minor-free graphs.	SODA	2024	DBLP DOI BibTeX RDF
14	Hsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Lazar Milenkovic, Shay Solomon, Cuong Than	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.	SODA	2024	DBLP DOI BibTeX RDF
14	Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi	Dichotomies for Tree Minor Containment with Structural Parameters.	WALCOM	2024	DBLP DOI BibTeX RDF
14	Kai Cui 0001, Gökçe Dayanikli, Mathieu Laurière, Matthieu Geist, Olivier Pietquin, Heinz Koeppl	Learning Discrete-Time Major-Minor Mean Field Games.	AAAI	2024	DBLP DOI BibTeX RDF
14	Peter J. Hammond	Roberts' weak welfarism theorem: a minor correction.	Soc. Choice Welf.	2023	DBLP DOI BibTeX RDF
14	Vida Dujmovic, Pat Morin, David R. Wood	Graph product structure for non-minor-closed classes.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
14	Zdenek Dvorák 0001, Ken-ichi Kawarabayashi	Additive non-approximability of chromatic number in proper minor-closed classes.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
14	Sergey Norin, Luke Postle	Connectivity and choosability of graphs with no Kt minor.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
14	Jorge Bruno, Paul Szeptycki	A proof of the tree alternative conjecture under the topological minor relation.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
14	Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos	k-apices of minor-closed graph classes. I. Bounding the obstructions.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
14	Tuukka Korhonen	Grid induced minor theorem for graphs of small degree.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
14	Claire Hilaire, Jean-Florent Raymond	Long Induced Paths in Minor-Closed Graph Classes and Beyond.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
14	Gwenaël Joret, William Lochet, Michal T. Seweryn	Edge Separators for Graphs Excluding a Minor.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF